Maximal matching and path matching counting in polynomial time for graphs of bounded clique width

  • Authors:

  • Benjamin Hellouin de Menibus;Takeaki Uno

  • Affiliations:

  • ENS Lyon, France;National Institute of Informatics, Tokyo, Japan

  • Venue:
  • TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 matchingcover 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(nf(k)) time where f is exponential in k or in O(ng(l)) time where g is linear or quadratic in l if an l-expression for G is given as input.