Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALGORITHMICA

2000

2000

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. Key Words. Spanning tree, Directed graph, Enumeration.

Related Content

Added |
17 Dec 2010 |

Updated |
17 Dec 2010 |

Type |
Journal |

Year |
2000 |

Where |
ALGORITHMICA |

Authors |
Sanjiv Kapoor, H. Ramesh |

Comments (0)