Skip to main content
SpringerLink
Log in

An algorithm for enumerating all directed spanning trees in a directed graph

  • Session 5a: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Included in the following conference series:

Abstract

A directed spanning tree in a directed graph G=(V, A) is a spanning tree such that no two arcs share their tails. In this paper, we propose an algorithm for listing all directed spanning trees of G. Its time and space complexities are O(¦A¦+ND(¦V¦, ¦A¦)) and O(¦A¦+DS(¦V¦, ¦A¦)), where D(¦V¦, ¦A¦) and DS(¦V¦, ¦A¦) are the time and space complexities of the data structure for updating the minimum spanning tree in an undirected graph with ¦V¦ vertices and ¦A¦ edges. Here N denotes the number of directed spanning trees in G.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. N. Gabow, E. W. Myers, “Finding All Spanning Trees of Directed and Undirected Graphs”, SIAM J. Comp., 7, 280–287, 1978.

    Article  Google Scholar 

  2. H. N. Kapoor and H. Ramesh, “Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs”, Lecture Notes in Computer Science, Springer-Verlag, 461–472, 1992.

    Google Scholar 

  3. A. Shioura, A. Tamura and T. Uno, “An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs”, SIAM J. Comp., to be appeared.

    Google Scholar 

  4. D. Eppstein, Z. Galil, G. F. Italiano and A. Nissenzweig, “Sparsification — A Technique for Speeding up Dynamic Graph Algorithms”, FOCS 33, 60–69, 1992.

    Google Scholar 

  5. G. N. Fredrickson, “Data Structure for On-line Updating of Minimum Spanning Trees, with Applications”, SIAM J. Comp., 14, No 4, 781–798, 1985.

    Article  Google Scholar 

  6. D. D. Sleator and R. E. Tarjan, “A Data Structure for Dynamic Trees”, J. Comp. Sys. Sci. 26, 362–391, 1983.

    Article  Google Scholar 

  7. R. E. Tarjan, “Depth-First Search and Linear Graph Algorithm”, SIAM J. Comp. 1, 146–169, 1972.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems Science, Tokyo Institute of Technology, 2-12-1 Oh-okayama, Meguro-ku, 152, Tokyo, Japan

    Takeaki Uno

Authors
  1. Takeaki Uno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uno, T. (1996). An algorithm for enumerating all directed spanning trees in a directed graph. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009492

Download citation

  • DOI: https://doi.org/10.1007/BFb0009492

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation