Modular-width

Abu-Khzam, Faisal N.; Markarian, Christine; Podipyan, Pavel

Modular-width

Abu-Khzam, Faisal N.; Markarian, Christine; Podipyan, Pavel

URI: http://hdl.handle.net/10725/7490

URL: https://link.springer.com/chapter/10.1007/978-3-319-59605-1_13

DOI: http://dx.doi.org/10.1007/978-3-319-59605-1 13

Date: 2018-04-23

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.

Citation:

Abu-Khzam, F. N., Li, S., Markarian, C., auf der Heide, F. M., & Podlipyan, P. (2017, June). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In International Workshop on Frontiers in Algorithmics (pp. 139-150). Springer, Cham.