Counting and sampling orientations on chordal graphs

DOI10.1007/978-3-030-96731-4_29MaRDI QIDQ2154115zbMATH OpenOpenAlexFDO

Authors Ivona Bezáková, Wenbo Sun

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

• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1057883 (Why is no real title available?)
• scientific article; zbMATH DE number 1775385 (Why is no real title available?)
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• scientific article; zbMATH DE number 6472599 (Why is no real title available?)
• Counting the number of independent sets in chordal graphs
• Generating a random sink-free orientation in quadratic time
• Hard Enumeration Problems in Geometry and Combinatorics
• On chordal graphs and their chromatic polynomials
• On the complexity of calculating factorials
• Probabilistic graphical models.
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Uniform sampling through the Lovász local lemma

Cited in

(2)

• Counting restricted orientations of random graphs
• Sampling Eulerian orientations of triangular lattice graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154115)