MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
From MaRDI portal
Publication:4733403
DOI10.1109/31.20199zbMath0683.68036MaRDI QIDQ4733403
M. N. S. Swamy, R. Jayakumar, Krishnaiyan Thulasiraman
Publication date: 1989
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6ea7967765ed85f9de6b5f138a518be9b5948983
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
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, Topological properties of a 3-regular small world network, Counting spanning trees in self-similar networks by evaluating determinants