An algorithm for enumerating all directed spanning trees in a directed graph
From MaRDI portal
Publication:6487436
DOI10.1007/bfb0009492zbMath1516.05212MaRDI QIDQ6487436
Publication date: 25 January 2023
Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: An algorithm for enumerating all directed spanning trees in a directed graph
