An Algorithm for Enumerating All Spanning Trees of a Directed Graph

被引：0
|
作者：
S. Kapoor
H. Ramesh
机构：
[1] Indian Institute of Technology,
[2] New Delhi,undefined
[3] India 10016. skapoor@henna.iitd.ernet.in.,undefined
[4] Department of Computer Science,undefined
[5] Indian Institute of Science,undefined
[6] Bangalore,undefined
[7] India 560012. ramesh@csa.iisc.ernet.in.,undefined
来源：
Algorithmica | 2000年 / 27卷
关键词：
Key words. Spanning tree, Directed graph, Enumeration.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：120 / 130
页数：10
相关论文
共 50 条
12345