Skip to main content
SpringerLink
Log in

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

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6648))

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. Journal of Algorithms 12, 308–340 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bandelt, H.J., Mulder, H.M.: Distance-hereditary Graphs. Journal of Combinatorial Theory, Series B 41(2), 182–208 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Corneil, D.G., Habib, M., Lanlignel, J.-M., Reed, B., Rotics, U.: Polynomial Time Recognition of Clique-Width ≤ 3 Graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 126–134. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Corneil, D.G., Rotics, U.: On the Relationship Between Clique-Width and Treewidth. SIAM Journal of Computing 34(4), 825–847 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sciences 46, 218–270 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. Theory of Computing Systems 33, 125–150 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Courcelle, B., Olariu, S.: Upper Bounds to the Clique-Width of Graphs. Discrete Applied Mathematics 101, 77–114 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dagum, P., Luby, M.: Approximating the Permanent of Graphs with Large Factors. Theoretical Computer Science 102, 283–305 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique width Minimization is NP-hard. Proceedings of the 38th annual ACM Symposium on Theory of Computing, session 8B, pp. 354–362 (2006)

    Google Scholar 

  10. Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic Lower Bounds for Problems Parameterized by Clique-Width. In: Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 493–502. ACM and SIAM (2010)

    Google Scholar 

  11. Giménez, O., Hliněný, P., Noy, M.: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 59–68. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science 11(3), 423–443 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kasteleyn, P.W.: Dimer Statistics and Phase Transitions. Journal of Mathematical Physics 4, 287–293 (1963)

    Article  MathSciNet  Google Scholar 

  14. Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing Graph Polynomials on Graphs of Bounded Clique-Width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 191–204. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Okamoto, Y., Uno, T., Uehara, R.: Counting the Independent Sets in a Chordal Graph. Journal of Discrete Algorithms 6(2), 229–242 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Okamoto, Y., Uehara, R., Uno, T.: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 296–307. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Oum, S., Seymour, P.: Approximating Clique-Width and Branch-Width. Journal of Combinatorial Theory, Series B 96(4), 514–528 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31, 398–427 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Valiant, L.G.: The Complexity of Computing the Permanent. Theoretical Computer Science 8, 189–201 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  20. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8, 410–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENS Lyon, France

    Benjamin Hellouin de Menibus

  2. National Institute of Informatics, Tokyo, 101–8430, Japan

    Takeaki Uno

Authors
  1. Benjamin Hellouin de Menibus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeaki Uno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Miami, 1365 Memorial Drive, 33146, Coral Gables, FL, USA

    Mitsunori Ogihara

  2. Department of Information and Communication Engineering, University of Electro-Comm, Chofugaoga 1-5-1, Chofu, 182-8585, Tokyo, Japan

    Jun Tarui

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Menibus, B.H., Uno, T. (2011). Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20877-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20876-8

  • Online ISBN: 978-3-642-20877-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation