Title of article
On end-vertices of Lexicographic Breadth First Searches Original Research Article
Author/Authors
Derek G. Corneil، نويسنده , , Ekkehard K?hler، نويسنده , , Jean-Marc Lanlignel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
434
To page
443
Abstract
Recently Lexicographic Breadth First Search (LBFS) has received considerable attention and has often been employed in a multi-sweep fashion. One variant of LBFS called LBFS+ breaks ties by choosing the last vertex of the tied set in a previous LBFS. This has motivated the study of vertices that may appear last in an LBFS (called end-vertices). In this paper, we present various theoretical and algorithmic results concerning end-vertices.
Keywords
Graph algorithm , Complexity , Simplicial vertex , Graph classes , Chordal graphs , Interval graphs , Cocomparability graphs , AT-free graphs , Lexicographic breadth first search
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887354
Link To Document