Skip to main content
SpringerLink
Log in

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We present an O(NV + V 3 ) 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 V 2 =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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Indian Institute of Technology, New Delhi, India 10016. skapoor@henna.iitd.ernet.in., , , , , , IN

    S. Kapoor

  2. Department of Computer Science, Indian Institute of Science, Bangalore, India 560012. ramesh@csa.iisc.ernet.in., , , , , , IN

    H. Ramesh

Authors
  1. S. Kapoor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Ramesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 11, 1997; revised March 6, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kapoor, S., Ramesh, H. An Algorithm for Enumerating All Spanning Trees of a Directed Graph . Algorithmica 27, 120–130 (2000). https://doi.org/10.1007/s004530010008

Download citation

  • Issue Date:

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

Search

Navigation