An Algorithm for enumerating All Spanning Trees of a Directed Graph

Kapoor, S and Ramesh, H (2000) An Algorithm for enumerating All Spanning Trees of a Directed Graph. In: Algorithmica, 27 (2). pp. 120-130.

Preview

PDF 23algorithm27(2)-jun2000.pdf Download (62kB)

Abstract

We present an O.NV CV3/ time algorithm for enumerating all spanning trees of a directed graph.This improves the previous best known bound of O.NECV C E/ [1] when V2 Do.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 C V C E/ time.

Item Type:	Journal Article
Publication:	Algorithmica
Publisher:	Springer Verlag
Additional Information:	Copyright of this article belongs to Springer Verlag.
Keywords:	Spanning tree;Directed graph;Enumeration
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	10 Sep 2004
Last Modified:	29 Sep 2010 10:24
URI:	http://eprints.iisc.ac.in/id/eprint/1797

Actions (login required)

View Item