Efficient and adaptive parameterized algorithms on modular decompositions

26 Apr 2018 Kratsch Stefan Nelles Florian

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS