Efficient and adaptive parameterized algorithms on modular decompositions

04/26/2018
by   Stefan Kratsch, et al.
0

We study the influence of a graph parameter called modular-width on the time complexity for optimally solving well-known polynomial problems such as Maximum Matching, Triangle Counting, and Maximum s-t Vertex-Capacitated Flow. The modular-width of a graph depends on its (unique) modular decomposition tree, and can be computed in linear time O(n+m) for graphs with n vertices and m edges. Modular decompositions are an important tool for graph algorithms, e.g., for linear-time recognition of certain graph classes. Throughout, we obtain efficient parameterized algorithms of running times O(f(mw)n+m), O(n+f(mw)m) , or O(f(mw)+n+m) for graphs of modular-width mw. Our algorithm for Maximum Matching, running in time O(mw^2 mw · n+m), is both faster and simpler than the recent O(mw^4n+m) time algorithm of Coudert et al. (SODA 2018). For several other problems, e.g., Triangle Counting and Maximum b-Matching, we give adaptive algorithms, meaning that their running times match the best unparameterized algorithms for worst-case modular-width of mw=Θ(n) and they outperform them already for mw=o(n), until reaching linear time for mw=O(1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2022

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

Many computational problems admit fast algorithms on special inputs, how...
research
07/17/2017

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

Parameterized complexity theory has enabled a refined classification of ...
research
04/25/2019

On adaptive algorithms for maximum matching

In the fundamental Maximum Matching problem the task is to find a maximu...
research
02/14/2022

On Triangle Counting Parameterized by Twin-Width

In this report we present an algorithm solving Triangle Counting in time...
research
10/12/2017

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

There are many classical problems in P whose time complexities have not ...
research
04/25/2018

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes

We address the following general question: given a graph class C on whic...
research
07/22/2019

Optimal In-place Algorithms for Basic Graph Problems

We present linear time in-place algorithms for several basic and fundam...

Please sign up or login with your details

Forgot password? Click here to reset