Unranking and ranking spanning trees of a graph

DOI10.1016/0196-6774(89)90016-3zbMath0681.68087OpenAlexW2028122921MaRDI QIDQ4730795

Charles J. Colbourn, Robert P. J. Day, Louis 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

zbMATH Keywords

ranking functionspanning trees of a graphunranking function

Mathematics Subject Classification ID

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

Related Items (13)

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

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