A flexible algorithm for generating all the spanning trees in undirected graphs
From MaRDI portal
Publication:1361419
DOI10.1007/PL00009171zbMATH Open0879.68084OpenAlexW1986646858MaRDI QIDQ1361419FDOQ1361419
Authors: 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
Recommendations
Cited In (17)
- An algorithm to generate all spanning trees with flow
- Pivot Gray codes for the spanning trees of a graph ft. the fan
- Listing subgraphs by Cartesian decomposition
- Listing all the minimum spanning trees in an undirected graph
- Minimum spanning trees in networks with varying edge weights
- Generating 3-vertex connected spanning subgraphs
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- An exact method to generate all nondominated spanning trees
- Listing all spanning trees in Halin graphs -- sequential and parallel view
- Reverse search for enumeration
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Title not available (Why is that?)
- Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
- MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
- 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
- New algorithm for generation of spanning trees
This page was built for publication: A flexible algorithm for generating all the spanning trees in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361419)
