Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped wit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2019-09
Hauptverfasser:	Ziobro, Michał, Pilipczuk, Marcin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Dependence Dynamic programming Graphs Run time (computers) Separators
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!