Counting and sampling orientations on chordal graphs

DOI10.1007/978-3-030-96731-4_29OpenAlexW4226206118MaRDI QIDQ2154115

Wenbo Sun, Ivona Bezáková

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_29

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Counting the number of independent sets in chordal graphs
• On the complexity of calculating factorials
• Hard Enumeration Problems in Geometry and Combinatorics
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• On chordal graphs and their chromatic polynomials
• Uniform Sampling Through the Lovász Local Lemma
• Generating a random sink-free orientation in quadratic time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting and sampling orientations on chordal graphs