Next Article in Journal
Recognition of Pulmonary Nodules in Thoracic CT Scans Using 3-D Deformable Object Models of Different Classes
Previous Article in Journal
Base Oils Biodegradability Prediction with Data Mining Techniques
Open AccessArticle

Graph Extremities Defined by Search Algorithms

LIMOS, Université Blaise Pascal, Ensemble scientifique des Cézeaux, F-63177 Aubière, France
Department of EE & CS, United States Military Academy, West Point, NY 10996, USA
LIRMM, 161, Rue Ada, F-34392 Montpellier, France
Author to whom correspondence should be addressed.
Algorithms 2010, 3(2), 100-124;
Received: 1 January 2010 / Revised: 9 February 2010 / Accepted: 22 February 2010 / Published: 24 March 2010
PDF [547 KB, uploaded 24 March 2010]


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. View Full-Text
Keywords: graph search; graph extremity; LexBFS; MCS; MLS graph search; graph extremity; LexBFS; MCS; MLS

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Berry, A.; Blair, J.R.; Bordat, J.-P.; Simonet, G. Graph Extremities Defined by Search Algorithms. Algorithms 2010, 3, 100-124.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top