Between treewidth and clique-width

DOI10.1007/978-3-319-12340-0_33MaRDI QIDQ2945207zbMATH OpenOpenAlexFDO

Authors Sigve Hortemo Sæther, Jan Arne Telle

Publication date 9 September 2015

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7758

Hamiltonian cycle graph coloring MaxCut edge dominating set

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)

Abstract: Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified by the four problems MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set that are all FPT parameterized by treewidth but none of which can be FPT parameterized by clique-width unless FPT = W[1], as shown by Fomin et al [7, 8]. We therefore seek a structural graph parameter that shares some of the generality of clique-width without paying this price. Based on splits, branch decompositions and the work of Vatshelle [18] on Maximum Matching-width, we consider the graph parameter sm-width which lies between treewidth and clique-width. Some graph classes of unbounded treewidth, like distance-hereditary graphs, have bounded sm-width. We show that MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set are all FPT parameterized by sm-width.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Between treewidth and clique-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945207)