EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH

DOI10.15807/JORSJ.38.331MaRDI QIDQ5285185zbMATH OpenOpenAlexFDO

Authors Akiyoshi Shioura, Akihisa Tamura

Publication date 25 May 1997

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.38.331

zbMATH Keywords

enumerating all spanning treesundirected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Faster enumeration of all spanning trees of a directed graph
• An algorithm for enumerating all spanning trees of a directed graph
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• A flexible algorithm for generating all the spanning trees in undirected graphs
• scientific article; zbMATH DE number 1160278
• An algorithm for enumerating all directed spanning trees in a directed graph
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• scientific article; zbMATH DE number 56828
• scientific article; zbMATH DE number 177570

Cited in

(18)

• Algorithms for generating convex sets in acyclic digraphs
• The problem of the optimal biobjective spanning tree
• Reverse search for enumeration
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• A pivot Gray code listing for the spanning trees of the fan graph
• Memory-efficient enumeration of constrained spanning trees
• Output-sensitive listing of bounded-size trees in undirected graphs
• scientific article; zbMATH DE number 56828 (Why is no real title available?)
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• 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
• Fast enumeration algorithms for non-crossing geometric graphs
• Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Efficiently enumerating spanning trees of k-trees
• Listing spanning trees of outerplanar graphs by Pivot-exchanges
• Generating cut conjunctions in graphs and related problems

This page was built for publication: EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285185)