Faster enumeration of all spanning trees of a directed graph

DOI10.1007/3-540-60220-8_82zbMath1502.68230OpenAlexW1599894364MaRDI QIDQ5057454

Sanjiv Kapoor, Ramesh Hariharan, 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Efficiency of a Good But Not Linear Set Union Algorithm
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Finding All Spanning Trees of Directed and Undirected Graphs
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

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