Generating random combinatorial objects

DOI10.1016/0196-6774(90)90002-VMaRDI QIDQ3493246zbMATH OpenOpenAlexFDO

Authors Vidyadhar G. Kulkarni

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(90)90002-v

zbMATH Keywords

spanning treesdirected graphrandom algorithms,t-paths

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorics in computer science (68R05)

Recommendations

• Random generation of trees and other combinatorial objects
• A calculus for the random generation of labelled combinatorial structures
• On random and adaptive parallel generation of combinatorial objects
• scientific article; zbMATH DE number 3864523
• scientific article; zbMATH DE number 1256746

Cited in

(13)

• Generating all distributions of objects to bins
• Linking and cutting spanning trees
• Random generation of combinatorial structures from a uniform distribution
• Pseudorandom generators for combinatorial shapes
• Determinant-preserving sparsification of SDDM matrices
• Random combinatorial objects
• Relational networks of conditional preferences
• On random and adaptive parallel generation of combinatorial objects
• Models of random subtrees of a graph
• Choosing a random spanning subtree: A case study
• A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
• Sampling random spanning arborescences in graphs with low conductance
• Exact sampling of spanning trees via fast-forwarded random walks

This page was built for publication: Generating random combinatorial objects

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