𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1178 || An algorithm for enumerating all directed spanning trees in a directed graph

✍ Scribed by Asano, Tetsuo; Igarashi, Yoshihide; Nagamochi, Hiroshi; Miyano, Satoru; Suri, Subhash

Book ID
120538323
Publisher
Springer Berlin Heidelberg
Year
1996
Weight
418 KB
Category
Article
ISBN
3540496335

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 519 || Algorithms for generating all spanning trees of undirected, directed and weighted graphs
✍ Dehne, Frank; Sack, JΓΆrg-RΓΌdiger; Santoro, Nicola πŸ“‚ Article πŸ“… 1991 πŸ› Springer-Verlag 🌐 German βš– 813 KB

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003. The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 subm