Generating random combinatorial objects

DOI10.1016/0196-6774(90)90002-VzbMath0709.68038OpenAlexW1968057111MaRDI QIDQ3493246

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

directed graphspanning treesrandom algorithms,t-paths

Mathematics Subject Classification ID

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

Related Items (6)

On random and adaptive parallel generation of combinatorial objects ⋮ Models of random subtrees of a graph ⋮ Relational networks of conditional preferences ⋮ Determinant-Preserving Sparsification of SDDM Matrices ⋮ Choosing a random spanning subtree: A case study ⋮ Linking and cutting spanning trees

This page was built for publication: Generating random combinatorial objects