Unranking and ranking spanning trees of a graph

DOI10.1016/0196-6774(89)90016-3zbMATH Open0681.68087OpenAlexW2028122921MaRDI QIDQ4730795FDOQ4730795

Authors: Charles J. Colbourn, R. Day, L. D. Nel 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90016-3

Recommendations

• Two Algorithms for Unranking Arborescences
• Ranking and Unranking of Non-regular Trees
• Linking and cutting spanning trees
• A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
• scientific article; zbMATH DE number 568846

zbMATH Keywords

ranking functionspanning trees of a graphunranking function

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited In (14)

• Linking and cutting spanning trees
• On the number of broadcast schemes in networks
• Determinant-preserving sparsification of SDDM matrices
• Models of random subtrees of a graph
• A Schur complement Cheeger inequality
• Unranking of small combinations from large sets
• The complexity of controlled selection
• Combinatorial aspects of network reliability
• Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
• A pivot Gray code listing for the spanning trees of the fan graph
• A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
• Network reliability: Numbers or insight? (A discussion paper)
• Perfect sampling methods for random forests
• Two Algorithms for Unranking Arborescences

This page was built for publication: Unranking and ranking spanning trees of a graph

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