Alluvion and cascade: fast data dissemination schemes in multihop wireless networks
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Approximation algorithms for constrained generalized tree alignment problem
Discrete Applied Mathematics
Efficient discovery of join plans in schemaless data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms
Using generalization of syntactic parse trees for taxonomy capture on the web
ICCS'11 Proceedings of the 19th international conference on Conceptual structures for discovering knowledge
Output-sensitive listing of bounded-size trees in undirected graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
From few components to an eulerian graph by adding arcs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
An algorithm to generate all spanning trees with flow
Mathematical and Computer Modelling: An International Journal
Inferring the semantic properties of sentences by mining syntactic parse trees
Data & Knowledge Engineering
Parameterized top-K algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we present algorithms for enumeration of spanning trees in undirected graphs, with and without weights. The algorithms use a search tree technique to construct a computation tree. The computation tree can be used to output all spanning trees by outputting only relative changes between spanning trees rather than the entire spanning trees themselves. Both the construction of the computation tree and the listing of the trees is shown to require $O(N+V+E)$ operations for the case of undirected graphs without weights. The basic algorithm is based on swapping edges in a fundamental cycle. For the case of weighted graphs (undirected), we show that the nodes of the computation tree of spanning trees can be sorted in increasing order of weight, in $O(N\log V+VE)$ time. The spanning trees themselves can be listed in $O(NV)$ time. Here $N$, $V$, and $E$ refer respectively to the number of spanning trees, vertices, and edges of the graph.