Sciweavers

ALGORITHMS
2010

Graph Extremities Defined by Search Algorithms

13 years 8 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called MLS and MLSM. In this paper, we investigate the properties of the vertex that is numbered 1 by MLS on a chordal graph and by MLSM on an arbitrary graph. We explain how this vertex is an extremity of the graph. Moreover, we show the remarkable property that the minimal separators included in the neighborhood of this vertex are totally ordered by inclusion.
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge
Added 28 Feb 2011
Updated 28 Feb 2011
Type Journal
Year 2010
Where ALGORITHMS
Authors Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet
Comments (0)