An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
From MaRDI portal
Publication:4337655
DOI10.1137/S0097539794270881zbMATH Open0870.05066OpenAlexW1988738304MaRDI QIDQ4337655FDOQ4337655
Authors: Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno 
Publication date: 26 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794270881
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (36)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- An algorithm to generate all spanning trees with flow
- The problem of the optimal biobjective spanning tree
- Pivot Gray codes for the spanning trees of a graph ft. the fan
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Listing subgraphs by Cartesian decomposition
- Listing all the minimum spanning trees in an undirected graph
- Generating 3-vertex connected spanning subgraphs
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- An algorithm for enumerating all directed spanning trees in a directed graph
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Computing the Tutte polynomial of a graph of moderate size
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Algorithms for generating convex sets in acyclic digraphs
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
- ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
- Efficient enumeration of dominating sets for sparse graphs
- Efficient enumeration of dominating sets for sparse graphs
- Constant amortized time enumeration of Eulerian trails
- Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Fast enumeration algorithms for non-crossing geometric graphs
- Proximity Search for Maximal Subgraph Enumeration
- On enumerating all minimal solutions of feedback problems
- Exact algorithms for the bottleneck Steiner tree problem
- Title not available (Why is that?)
- Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
- A pivot Gray code listing for the spanning trees of the fan graph
- New algorithm for generation of spanning trees
- Output-sensitive listing of bounded-size trees in undirected graphs
- CAGE: cache-aware graphlet enumeration
- An algorithm for the enumeration of spanning trees
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Constant time enumeration by amortization
This page was built for publication: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337655)
