Counting and sampling orientations on chordal graphs

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hard Enumeration Problems in Geometry and Combinatorics
• Counting the number of independent sets in chordal graphs
• On chordal graphs and their chromatic polynomials
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Title not available (Why is that?)
• On the complexity of calculating factorials
• Generating a random sink-free orientation in quadratic time
• 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)