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

DOI10.1109/31.20199zbMATH Open0683.68036OpenAlexW2144873820MaRDI QIDQ4733403FDOQ4733403

Authors: R. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy 

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

Recommendations

• Complexity of computation of a spanning tree enumeration algorithm
• An algorithm for the enumeration of spanning trees
• New algorithm for generation of spanning trees
• scientific article
• A flexible algorithm for generating all the spanning trees in undirected graphs

zbMATH Keywords

spanning treeenumeration problems

Mathematics Subject Classification ID

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

Cited In (4)

• Topological properties of a 3-regular small world network
• An algorithm to generate all spanning trees with flow
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733403)