Parameterized algorithms for modular-width
2013 (English)In: Parameterized and Exact Computation: 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, Springer, 2013, 163-176 p.Conference paper (Refereed)
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILP and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.
Place, publisher, year, edition, pages
Springer, 2013. 163-176 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 8246 LNCS
FPT algorithms, Graph parameters, Graph problems, Hamiltonian cycle, Hamiltonian path, Modular decomposition, Parameterized algorithm, Structural graph
IdentifiersURN: urn:nbn:se:kth:diva-143283DOI: 10.1007/978-3-319-03898-8_15ScopusID: 2-s2.0-84893094633ISBN: 978-331903897-1OAI: oai:DiVA.org:kth-143283DiVA: diva2:706378
8th International Symposium on Parameterized and Exact Computation, IPEC 2013; Sophia Antipolis; France; 4 September 2013 through 6 September 2013
QC 201403202014-03-202014-03-192014-03-20Bibliographically approved