10.1007/978-3-319-59605-1_13
Abu-Khzam, Faisal N.
Faisal N.
Abu-Khzam
Li, Shouwei
Shouwei
Li
Markarian, Christine
Christine
Markarian
Meyer auf der Heide, Friedhelm
Friedhelm
Meyer auf der Heide
Podlipyan, Pavel
Pavel
Podlipyan
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
2017
2017-10-17T12:41:07Z
2019-01-03T13:18:39Z
conference
https://ris.uni-paderborn.de/record/82
https://ris.uni-paderborn.de/record/82.json
238276 bytes
application/pdf
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.