Parameterized Algorithms for Modular-Width

@article{Gajarsk2013ParameterizedAF,
  title={Parameterized Algorithms for Modular-Width},
  author={Jakub Gajarsk{\'y} and Michael Lampis and Sebastian Ordyniak},
  journal={ArXiv},
  year={2013},
  volume={abs/1308.2858}
}
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 ILPs… 
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
TLDR
Modular-width in parameterized parallel complexity is studied and it is shown that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.
Between Treewidth and Clique-Width
TLDR
The graph parameter sm-width is considered which lies between treewidth and clique-width and it is shown that MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set are all FPT parameterized by sm- width.
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
TLDR
Evidence is given that co-treewidth is a useful width parameter for handling dense instances of problems for which an FPT algorithm for clique-width is unlikely to exist and an algorithmic framework for co-degeneracy is developed based on the notion of Bondy-Chvátal closure.
P-FPT algorithms for bounded clique-width graphs
TLDR
This paper studies several graph theoretic problems for which hardness results exist and gives hardness results and P-FPT algorithms, using clique-width and some of its upper bounds as parameters, based on preprocessing methods using modular decomposition and split decomposition.
Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width
TLDR
A recipe is developed that is able to simplify the process of obtaining polynomial Turing compressions for a class of graph problems parameterized by modular-width and new parameterized algorithms for these problems are obtained.
Parametrised Algorithms for Directed Modular Width
Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width,
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
TLDR
This article studies several graph-theoretic problems for which hardness results exist and gives hardness results and P-FPT algorithms, using clique-width and some of its upper bounds as parameters, based on preprocessing methods using modular decomposition and split decomposition.
Structural properties of graphs and eficient algorithms: Problems Between Parameters
TLDR
It is shown that an optimal solution to the Minimum Length Bounded Cut problem can be computed in time f(k)n, and it is proved that (under assumption that FPT ̸= W[1]) no such algorithm can exist if the parameter k is the tree-width of the input graph.
Grundy Distinguishes Treewidth from Pathwidth
TLDR
Grundy Coloring is considered, a variation of coloring where one seeks to calculate the worst possible coloring that could be assigned to a graph by a greedy First-Fit algorithm, and it is shown that this well-studied problem is FPT parameterized by pathwidth; however, it becomes significantly harder (W[1]-hard) when parameterization by treewidth.
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Algorithmic lower bounds for problems parameterized by clique-width
TLDR
This paper obtains the asymptotically tight bounds for Max-Cut and Edge Dominating Set by showing that both problems cannot be solved in time f(t)no(t), unless Exponential Time Hypothesis (ETH) collapses; and can be solve in time nO(t, where f is an arbitrary function of t, on input of size n and clique-width at most t.
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
TLDR
It is proved that this is also the case for graphs of clique-width at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer allowed to use edge set quantifications.
Intractability of Clique-Width Parameterizations
TLDR
The results imply that the running time of many clique-width-based algorithms is essentially the best the authors can hope for (up to a widely believed assumption from parameterized complexity, namely $FPT\neq W[1]$).
Clique-width: on the price of generality
TLDR
This paper shows that the running time O(nf(k)) of many clique-width based algorithms is essentially the best the authors can hope for (up to a widely believed assumption from parameterized complexity, namely FPT ≠ W[1])---the price they pay for generality.
Graph Layout Problems Parameterized by Vertex Cover
TLDR
This paper study's basic ingredient is a classical algorithm for Integer Linear Programming when parameterized by dimension, designed by Lenstra and later improved by Kannan, showing that all the mentioned problems are fixed parameter tractable.
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
TLDR
A new parameter called twin-cover is introduced and it is shown that it is capable of solving a wide range of hard problems while also being much less restrictive than vertex cover and attaining low values even on dense graphs.
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
TLDR
This paper develops applications to several classes of graphs that include cographs and are defined by forbidding subgraphs with ``too many'' induced paths with four vertices, and proves that this is also the case for graphs of clique-width at most k.
Rank-width and vertex-minors
Combinatorial Optimization on Graphs of Bounded Treewidth
TLDR
The concepts of treewidth and tree decompositions are introduced, and the technique with the Weighted Independent Set problem is illustrated, to survey some of the latest developments.
Boolean-width of graphs
...
...