Complexity of computation of a spanning tree enumeration algorithm
From MaRDI portal
Publication:3341895
DOI10.1109/TCS.1984.1085435zbMath0549.68035MaRDI QIDQ3341895
M. N. S. Swamy, R. Jayakumar, Krishnaiyan Thulasiraman
Publication date: 1984
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcs.1984.1085435
speed up; path compression; complexity analysis of Char's algorithm; spanning tree enumeration algorithm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
An algorithm to generate all spanning trees with flow, Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph