Graph Extremities Defined by Search Algorithms
AbstractGraph 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. View Full-Text
Share & Cite This Article
Berry, A.; Blair, J.R.; Bordat, J.-P.; Simonet, G. Graph Extremities Defined by Search Algorithms. Algorithms 2010, 3, 100-124.
Berry A, Blair JR, Bordat J-P, Simonet G. Graph Extremities Defined by Search Algorithms. Algorithms. 2010; 3(2):100-124.Chicago/Turabian Style
Berry, Anne; Blair, Jean R.S.; Bordat, Jean-Paul; Simonet, Geneviève. 2010. "Graph Extremities Defined by Search Algorithms." Algorithms 3, no. 2: 100-124.