DeepAI AI Chat
Log In Sign Up

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

by   Benjamin Hellouin de Menibus, et al.
ENS Lyon

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matching-cover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, we develop a way to classify the path matchings in a polynomial number of equivalent classes. Using these, we develop dynamic programing algorithms that run in polynomial time of the graph size, but in exponential time of the clique-width. In particular, we show that for a graph G of n vertices and clique-width k, these problems can be solved in O(n^f(k)) time where f is exponential in k or in O(n^g(l)) time where g is linear or quadratic in l if an l-expression for G is given as input.


page 1

page 2

page 3

page 4


On the Clique-Width of Unigraphs

Clique-width is a well-studied graph parameter. For graphs of bounded cl...

Counting homomorphisms in plain exponential time

In the counting Graph Homomorphism problem (#GraphHom) the question is: ...

Potential Maximal Cliques Parameterized by Edge Clique Cover

We show that the number of minimal separators on graphs with edge clique...

Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem

The Quantum Alternating Operator Ansatz (QAOA+) framework has recently g...

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

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

The Graphs of Stably Matchable Pairs

We study the graphs formed from instances of the stable matching problem...

Finding small-width connected path decompositions in polynomial time

A connected path decomposition of a simple graph G is a path decompositi...