The role of planarity in connectivity problems parameterized by treewidth

For some years it was believed that for “connectivity” problems such as Hamiltonian Cycle, algorithms running in time 2O(tw)⋅nO(1) – called single-exponential – existed only on planar and other topologically constrained graph classes, where tw stands for the treewidth of the n-vertex input graph. Th...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 570; pp. 1 - 14
Main Authors:	Baste, Julien, Sau, Ignasi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2015 Elsevier
Subjects:	Algorithms Connectivity problems Constraints Conveying Dynamic programming Graphs Mathematics Parameterized complexity Planar graphs Running in Single-exponential algorithms Stands Supports Treewidth Connectivity problems Dynamic programming Parameterized complexity Single-exponential algorithms Planar graphs Treewidth
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!