Graph Extremities Defined by Search Algorithms

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 th...

Full description

Bibliographic Details
Main Authors: Jean-Paul Bordat, Geneviève Simonet, Jean R.S. Blair, Anne Berry
Format: Article
Language:English
Published: MDPI AG 2010-03-01
Series:Algorithms
Subjects:
graph search
graph extremity
LexBFS
MCS
MLS
Online Access:http://www.mdpi.com/1999-4893/3/2/100/

Internet

http://www.mdpi.com/1999-4893/3/2/100/

Similar Items