scientific article; zbMATH DE number 177570
From MaRDI portal
Publication:4037441
zbMATH Open0764.68076MaRDI QIDQ4037441FDOQ4037441
Authors: Sanjiv Kapoor, H. Ramesh 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- An algorithm for enumerating all spanning trees of a directed graph
- An algorithm for the enumeration of spanning trees
- A flexible algorithm for generating all the spanning trees in undirected graphs
- Faster enumeration of all spanning trees of a directed graph
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (19)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- Inferring strings from suffix trees and links on a binary alphabet
- An algorithm to generate all spanning trees with flow
- Listing subgraphs by Cartesian decomposition
- Heuristic and exact algorithms for the spanning tree detection problem
- Listing all the minimum spanning trees in an undirected graph
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- Traversing combinatorial 0/1-polytopes via optimization
- An algorithm for enumerating all directed spanning trees in a directed graph
- An exact method to generate all nondominated spanning trees
- Listing all spanning trees in Halin graphs -- sequential and parallel view
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Faster enumeration of all spanning trees of a directed graph
- MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
- Title not available (Why is that?)
- Generating the maximum spanning trees of a weighted graph
- Counting Minimum Weight Spanning Trees
- Design and dimensioning of hydrogen transmission pipeline networks
- Output-sensitive listing of bounded-size trees in undirected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037441)
