A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
From MaRDI portal
Publication:3022025
DOI10.1142/S0129054104002650zbMath1067.05030MaRDI QIDQ3022025
Ömer Eğecioğlu, S. Gill Williamson, Jeffery B. Remmel
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002650
ranking; enumeration; complete bipartite graph; spanning tree; unranking; spanning forest; combinatorial generation; filtered digraph
Related Items
The combinatorics of Jeff Remmel, Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
Cites Work