scientific article; zbMATH DE number 177570

MaRDI QIDQ4037441zbMATH OpenFDO

Authors Sanjiv Kapoor, H. Ramesh

Publication date 18 May 1993

zbMATH Keywords

spanning tree enumeration

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

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

Cited in

(22)

• Inferring strings from suffix trees and links on a binary alphabet
• Algorithm for sequential construction of spanning minimal directed forests
• Design and dimensioning of hydrogen transmission pipeline networks
• scientific article; zbMATH DE number 56828 (Why is no real title available?)
• Listing subgraphs by Cartesian decomposition
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• Listing all the minimum spanning trees in an undirected graph
• A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Output-sensitive listing of bounded-size trees in undirected graphs
• Computing the fully optimal spanning tree of an ordered bipolar directed graph
• An exact method to generate all nondominated spanning trees
• Generating the maximum spanning trees of a weighted graph
• Faster enumeration of all spanning trees of a directed graph
• Traversing combinatorial 0/1-polytopes via optimization
• Listing all spanning trees in Halin graphs -- sequential and parallel view
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• Counting Minimum Weight Spanning Trees
• Heuristic and exact algorithms for the spanning tree detection problem
• An algorithm for enumerating all directed spanning trees in a directed graph
• An algorithm to generate all spanning trees with flow
• MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis

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)