A flexible algorithm for generating all the spanning trees in undirected graphs

DOI10.1007/PL00009171zbMath0879.68084OpenAlexW1986646858MaRDI QIDQ1361419

O. Diekmann

Publication date: 23 July 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009171

zbMATH Keywords

spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Minimum spanning trees in networks with varying edge weights, Reverse search for enumeration, Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms, Unnamed Item, Listing all spanning trees in Halin graphs — sequential and Parallel view, An algorithm to generate all spanning trees with flow, A pivot Gray code listing for the spanning trees of the fan graph, Dynamic programming for spanning tree problems: application to the multi-objective case, Generating 3-vertex connected spanning subgraphs, Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph