Algorithmica

, Volume 27, Issue 2, pp 120–130 | Cite as

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

  • S. Kapoor
  • H. Ramesh

Abstract.

We present an O(NV + V3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V+E) [1] when V2=o(N) , which will be true for most graphs. Here, N refers to the number of spanning trees of a graph having V vertices and E edges. The algorithm is based on the technique of obtaining one spanning tree from another by a series of edge swaps. This result complements the result in the companion paper [3] which enumerates all spanning trees in an undirected graph in O(N+V+E) time.

Key words. Spanning tree, Directed graph, Enumeration. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© 2000 Springer-Verlag New York Inc.

Authors and Affiliations

  • S. Kapoor
    • 1
  • H. Ramesh
    • 2
  1. 1.Indian Institute of Technology, New Delhi, India 10016. skapoor@henna.iitd.ernet.in.IN
  2. 2.Department of Computer Science, Indian Institute of Science, Bangalore, India 560012. ramesh@csa.iisc.ernet.in.IN

Personalised recommendations