Complexity of computation of a spanning tree enumeration algorithm

DOI10.1109/TCS.1984.1085435MaRDI QIDQ3341895zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

complexity analysis of Char's algorithmpath compressionspanning tree enumeration algorithmspeed up

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for the enumeration of spanning trees
• Tree enumeration and tree algorithm complexity computation
• On the complexity of computing treelength
• On the Complexity of Computing Treelength
• scientific article; zbMATH DE number 861414
• A parallel algorithm for the enumeration of the spanning trees of a graph
• scientific article; zbMATH DE number 56828
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• scientific article; zbMATH DE number 7650919
• Memory-efficient enumeration of constrained spanning trees

Cited in

(8)

• A parallel algorithm for the enumeration of the spanning trees of a graph
• An algorithm for the enumeration of spanning trees
• An algorithm to generate all spanning trees with flow
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• New algorithm for generation of spanning trees
• MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• An algorithm for enumerating all directed spanning trees in a directed graph

This page was built for publication: Complexity of computation of a spanning tree enumeration algorithm

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