An algorithm for enumerating all spanning trees of a directed graph

DOI10.1007/s004530010008zbMath0951.68117OpenAlexW2090660215MaRDI QIDQ1977130

H. Ramesh, Sanjiv Kapoor

Publication date: 18 December 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://eprints.iisc.ac.in/1797/1/23algorithm27%282%29-jun2000.pdf

zbMATH Keywords

directed graphspanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences ⋮ Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms ⋮ Minimum Leaf Out-Branching Problems ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph

This page was built for publication: An algorithm for enumerating all spanning trees of a directed graph