Name
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, Gajarsk3'7 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-59605-1_13 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Modular decomposition,Parameterized complexity,Combinatorics,Hamiltonian path,Edge dominating set,Matching (graph theory),Treewidth,Clique problem,Mathematics,Maximum cut | Conference | 10336 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Faisal N. Abu Khzam | 1 | 404 | 36.25 |
| Shouwei Li | 2 | 1 | 2.04 |
| Christine Markarian | 3 | 2 | 3.08 |
| Friedhelm Meyer auf der Heide | 4 | 1744 | 238.01 |
| Pavel Podlipyan | 5 | 1 | 2.04 |