Sampling unlabeled chordal graphs in expected polynomial time

DOI10.4230/LIPICS.STACS.2025.46MaRDI QIDQ7287783zbMATH OpenFDO

Authors Ursula Hebert-Johnson, Daniel Lokshtanov

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.46

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithms and Computation
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Counting unlabeled \(k\)-trees
• Generating labeled planar graphs uniformly at random
• Generating Random Unlabelled Graphs
• Generating unlabeled connected cubic planar graphs uniformly at random
• scientific article; zbMATH DE number 3152801 (Why is no real title available?)
• scientific article; zbMATH DE number 3910422 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Kombinatorische Anzahlbestimmungen in Relationen
• Note on enumeration of labeled split graphs.
• Random generation and enumeration of bipartite permutation graphs
• Random generation of combinatorial structures from a uniform distribution
• The random selection of unlabeled graphs
• Uniform generation of random graphs with power-law degree sequences
• Uniform generation of random regular graphs
• Uniform random sampling of planar graphs in linear time

This page was built for publication: Sampling unlabeled chordal graphs in expected polynomial time

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