Two Algorithms for Unranking Arborescences
From MaRDI portal
Publication:4876694
DOI10.1006/jagm.1996.0014zbMath0843.68087OpenAlexW2062877152MaRDI QIDQ4876694
Charles J. Colbourn, Eugene T. Neufeld, Wendy J. Myrvold
Publication date: 4 June 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0014
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
The number of Euler tours of random directed graphs, Reverse-Safe Text Indexing, Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms, Models of random subtrees of a graph, Relational networks of conditional preferences, Determinant-Preserving Sparsification of SDDM Matrices, Fast sequential importance sampling to estimate the graph reliability polynomial, Another involution principle-free bijective proof of Stanley's hook-content formula, Linking and cutting spanning trees
