An algorithm to generate all spanning trees with flow
From MaRDI portal
Publication:1410995
DOI10.1016/S0895-7177(02)00096-1zbMath1023.05032OpenAlexW1964420814MaRDI QIDQ1410995
Publication date: 15 October 2003
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(02)00096-1
Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)
Cites Work
- A flexible algorithm for generating all the spanning trees in undirected graphs
- Complexity of computation of a spanning tree enumeration algorithm
- Reliability Evaluation in Computer-Communication Networks
- Capacity Consideration in Reliability Analysis of Communication Systems
- Finding All Spanning Trees of Directed and Undirected Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
This page was built for publication: An algorithm to generate all spanning trees with flow