Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
From MaRDI portal
Publication:4834379
DOI10.1137/S009753979225030XzbMath0827.68053OpenAlexW2073647226MaRDI QIDQ4834379
Publication date: 30 May 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979225030x
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (21)
Constant Time Enumeration by Amortization ⋮ Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ Faster enumeration of all spanning trees of a directed graph ⋮ ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS ⋮ Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract) ⋮ Graph-based estimators for paired comparison data ⋮ 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 ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ On the complexity of rainbow spanning forest problem ⋮ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties ⋮ On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay ⋮ Finding multi-objective supported efficient spanning trees ⋮ The problem of the optimal biobjective spanning tree ⋮ Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph ⋮ Approximation algorithms for constrained generalized tree alignment problem ⋮ From Few Components to an Eulerian Graph by Adding Arcs ⋮ Algorithms for generating convex sets in acyclic digraphs
This page was built for publication: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
