Influence of the tie-break rule on the end-vertex problem

End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be r...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 16 no. 2; H. PRIMA 2013; S. 57 - 72
Hauptverfasser:	Charbit, Pierre, Habib, Michel, Mamcarz, Antoine
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 29.07.2014 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [math.math-co] mathematics [math]/combinatorics [math.co] Algorithms Combinatorics Computer Science Data Structures and Algorithms Discrete Mathematics Graph theory Mathematical research Mathematics
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!