New algorithm for generation of spanning trees

DOI10.1007/BF01068812zbMATH Open0691.68075MaRDI QIDQ3033347FDOQ3033347

Authors: Boris V. Cherkassky 

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

Recommendations

• Complexity of computation of a spanning tree enumeration algorithm
• An algorithm for the enumeration of spanning trees
• A flexible algorithm for generating all the spanning trees in undirected graphs
• scientific article; zbMATH DE number 1256746
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs

zbMATH Keywords

spanning treesRead-Tarjan algorithm

Mathematics Subject Classification ID

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

Cites Work

• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees

Cited In (4)

• Title not available (Why is that?)
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• A parallel algorithm for the enumeration of the spanning trees of a graph
• MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis

This page was built for publication: New algorithm for generation of spanning trees

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