Constrained ear decompositions in graphs and digraphs

Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a given graph admits an ear decomposition in whi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 21 no. 4; číslo Graph Theory; s. COV2 - 19
Hlavní autori:	Havet, Frédéric, Nisse, Nicolas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 02.09.2019 Discrete Mathematics & Theoretical Computer Science
Predmet:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] [info.info-dm]computer science [cs]/discrete mathematics [cs.dm] Computational Complexity Computer Science Decomposition Decomposition (Mathematics) Discrete Mathematics Ear Graph theory Graphs Handles Integers Mathematical research Polynomials Traveling salesman problem France
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!