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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Mathematics and Theoretical Computer Science Ročník 16 no. 2; číslo PRIMA 2013; s. 57 - 72
Hlavní autoři:	Charbit, Pierre, Habib, Michel, Mamcarz, Antoine
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 29.07.2014 Discrete Mathematics & Theoretical Computer Science
Témata:	[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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!