Journal Article10.1137/0206011
Two Algorithms for Generating Weighted Spanning Trees in Order
153
TL;DR: In this paper, two algorithms for generating spanning trees of a connected graph in order of increasing weight are presented, where the running time is O(K + K + E) and the space is O (K + E).
read more
Abstract: Two algorithms for generating spanning trees of a connected graph in order of increasing weight are presented. The first generates the K smallest weight trees, where K can be specified in advance or during execution of the algorithm. The run time is $O(KE\alpha (E,V) + E\log E)$ and the space is $O(K + E)$; here V is the number of vertices, E is the number of edges, and $\alpha$ is Tarjan’s inverse of Ackermann’s function and is very slow-growing. The algorithm uses a minimum weight spanning tree as a “reference tree”, and exchanges edges to derive other trees. The second algorithm, a modification of the first, generates all spanning trees of the graph, in order. If N is the number of spanning trees, the time is $O(NE)$ and the space is $O(N+E)$.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning Bayesian networks: the combination of knowledge and statistical data
David Heckerman,Dan Geiger,David Maxwell Chickering +2 more
- 29 Jul 1994
TL;DR: It is shown that likelihood equivalence when combined with previously made assumptions implies that the user's priors for network parameters can be encoded in a single Bayesian network for the next case to be seen—aprior network—and a single measure of confidence for that network.
•Book
The Algorithm Design Manual
Steven Skiena
- 01 Jan 1980
TL;DR: This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency.
1.3K
On the History of the Minimum Spanning Tree Problem
Ron Graham,Pavol Hell +1 more
TL;DR: There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century.
911
Steiner problem in networks: a survey
TL;DR: The problem of determining a minimum cost connected network G that spans a given subset of vertices is known in the literature as the Steiner problem in networks and exact algorithms and heuristics are surveyed.
788
Hardness of robust network design
Chandra Chekuri,F. B. Shepherd,Gianpaolo Oriolo,Maria Grazia Scutellà +3 more
- 01 Aug 2007
TL;DR: The authors settle the complexity status of the robust network design problem in undirected graphs with a single-source version of the problem where the flow-cut gap is known to be one and shows that this restricted problem is coNP-Hard.
248
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Graph theory with applications to engineering and computer science
N.R. Malik
- 01 Oct 1975
TL;DR: Graph Theory and Its Applications to Problems of Society and its Applications to Algorithms and Computer Science.
1.6K
Efficiency of a Good But Not Linear Set Union Algorithm
TL;DR: It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.
A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem
TL;DR: It is shown how the K shortest (loopless) paths in an n-node network with positive and negative arcs can be computed with an amount of computation which is O(Kn 3 ).
507
Finding Minimum Spanning Trees
TL;DR: This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem.
465