Extremities and orderings defined by generalized graph search algorithms

Anne Berry,Jean-Paul Bordat,Jean Blair,Geneviève Simonet,Richard Krueger

doi:10.1016/j.endm.2005.06.066

Extremities and orderings defined by generalized graph search algorithms

Anne Berry, Jean-Paul Bordat + Show 3 more

https://doi.org/10.1016/j.endm.2005.06.066

Copy DOI

Journal: Electronic Notes in Discrete Mathematics	Publication Date: Oct 1, 2005
Citations: 2

Affiliation: Montpellier Laboratory of Informatics, Robotics and Microelectronics, United States Military Academy, University of Toronto

#Chordal Graph #Arbitrary Graph + Show 3 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Abstract We define Algorithm MLS which uses a labelling structure to generalize all known graph searches which compute a peo on a chordal graph, as well as its extension MLSM, which computes an meo on an arbitrary graph. We also examine the vertices numbered as 1 by these algorithms, and show how they can be seen as extremities of the graph.

Full Text