Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
From MaRDI portal
Publication:5851114
DOI10.1007/978-3-642-11409-0_26zbMath1273.05180MaRDI QIDQ5851114
Ryuhei Uehara, Takeaki Uno, Yoshio Okamoto
Publication date: 21 January 2010
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_26
68Q25: Analysis of algorithms and problem complexity
05C30: Enumeration in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Counting Perfect Matchings and the Switch Chain, Graph classes and the switch Markov chain for matchings, Solving Matching Problems Efficiently in Bipartite Graphs, Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
