Counting and sampling orientations on chordal graphs
From MaRDI portal
Publication:2154115
DOI10.1007/978-3-030-96731-4_29MaRDI QIDQ2154115
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_29
68Wxx: Algorithms in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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