DeepAI AI Chat
Log In Sign Up

Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width

by   Stefan Kratsch, et al.
Humboldt-Universität zu Berlin

Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small modular-width or small tree-width, than on general graphs. One challenge is to attain the greatest generality of such results, i.e., being applicable to less restrictive input classes, without losing much in terms of running time. Building on the use of algebraic expressions we present a clean and robust way of combining such homogeneous structure into more complex heterogeneous structure, and we show-case this for the combination of modular-width, tree-depth, and a natural notion of modular tree-depth. We give a generic framework for designing efficient parameterized algorithms on the created graph classes, aimed at getting competitive running times that match the homogeneous cases. To show the applicability we give efficient parameterized algorithms for Negative Cycle Detection, Vertex-Weighted All-Pairs Shortest Paths, and Triangle Counting.


page 1

page 2

page 3

page 4


Efficient and adaptive parameterized algorithms on modular decompositions

We study the influence of a graph parameter called modular-width on the ...

Efficient parameterized algorithms for computing all-pairs shortest paths

Computing all-pairs shortest paths is a fundamental and much-studied pro...

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms

There are many classical problems in P whose time complexities have not ...

Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width

In this paper we investigate the parameterized complexity for NP-hard gr...

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

Parameterized complexity theory has enabled a refined classification of ...

Rank Based Approach on Graphs with Structured Neighborhood

In this paper, we combine the rank-based approach and the neighbor-equiv...