@article{Gabow1978,
author = "Gabow, Harold N. and Myers, Eugene W.",
doi = "10.1137/0207024",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,10,252 364,252-364,4,5,6,7,8,9,algorithms of varying efficiency,algorithms varying efficiency,all spanning trees,all spanning trees of,arborescence,bridge,depth first search,depth-first search,directed,directed and,have been proposed,introduction,networks,pp,problem finding,solution electrical,spanning tree,the problem of finding,the solution of electrical,undirected graphs arises,undirected graphs arises in",
link = "http://epubs.siam.org/doi/abs/10.1137/0207024",
month = "aug",
number = "3",
pages = "280--287",
publisher = "SIAM",
title = "Finding All Spanning Trees of Directed and Undirected Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207024",
volume = "7",
year = "1978",
}