EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH

DOI10.15807/jorsj.38.331zbMath0862.90124OpenAlexW344142806MaRDI QIDQ5285185

Akiyoshi Shioura, Akihisa Tamura

Publication date: 25 May 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.38.331

zbMATH Keywords

undirected graphenumerating all spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Memory-efficient enumeration of constrained spanning trees, Reverse search for enumeration, Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract), Listing all spanning trees in Halin graphs — sequential and Parallel view, A pivot Gray code listing for the spanning trees of the fan graph, Generating cut conjunctions in graphs and related problems, Fast enumeration algorithms for non-crossing geometric graphs, The problem of the optimal biobjective spanning tree, Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph, Algorithms for generating convex sets in acyclic digraphs