Faster enumeration of all spanning trees of a directed graph

DOI10.1007/3-540-60220-8_82MaRDI QIDQ5057454zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar

Publication date 16 December 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60220-8_82

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Enumeration in graph theory (05C30)

Recommendations

• An algorithm for enumerating all spanning trees of a directed graph
• An algorithm for enumerating all directed spanning trees in a directed graph
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• An algorithm for the enumeration of spanning trees
• A parallel algorithm for the enumeration of the spanning trees of a graph
• Enumeration of spanning trees of graph: alternative methods
• scientific article; zbMATH DE number 56828
• Memory-efficient enumeration of constrained spanning trees
• scientific article; zbMATH DE number 861414

Cites work

• scientific article; zbMATH DE number 177570 (Why is no real title available?)
• scientific article; zbMATH DE number 3375513 (Why is no real title available?)
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding All Spanning Trees of Directed and Undirected Graphs
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Two Algorithms for Generating Weighted Spanning Trees in Order

Cited in

(3)

• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• An algorithm for enumerating all directed spanning trees in a directed graph
• scientific article; zbMATH DE number 177570 (Why is no real title available?)

This page was built for publication: Faster enumeration of all spanning trees of a directed graph

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