Counting independent sets in cocomparability graphs

DOI10.1016/j.ipl.2018.12.005zbMath1405.05082arXiv1808.09853WikidataQ61821452 ScholiaQ61821452MaRDI QIDQ1721932

Haiko Müller, Martin Dyer

Publication date: 13 February 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09853

zbMATH Keywords

counting; independent set; graph algorithms; linear time algorithm; cocomparability graph

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Counting independent sets in graphs with bounded bipartite pathwidth, Counting independent sets in tricyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximately counting locally-optimal structures
• Counting independent sets in tree convex bipartite graphs
• Counting the number of independent sets in chordal graphs
• Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
• Linear-time algorithms for counting independent sets in bipartite permutation graphs
• The relative complexity of approximate counting problems
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Linear Time LexDFS on Cocomparability Graphs.
• Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
• Graph Classes: A Survey
• The Transitive Reduction of a Directed Graph