MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis

DOI10.1109/31.20199zbMath0683.68036OpenAlexW2144873820MaRDI 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

zbMATH Keywords

spanning treeenumeration problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

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

This page was built for publication: MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis