Results 131 to 140 of about 41,748 (161)
Some of the next articles are maybe not open access.
Online Minimum Spanning Tree with Advice
International Journal of Foundations of Computer Science, 2016In the online minimum spanning tree problem, a graph is revealed vertex by vertex; together with every vertex, all edges to vertices that are already known are given, and an online algorithm must irrevocably choose a subset of them as a part of its solution.
Bianchi, Maria Paola +4 more
openaire +5 more sources
Increasing the Weight of Minimum Spanning Trees
Journal of Algorithms, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Greg N. Frederickson, Roberto Solis-Oba
openaire +4 more sources
On Minimum Edge Ranking Spanning Trees
Journal of Algorithms, 1999Summary: We introduce the problem of computing a Minimum Edge Ranking Spanning Tree (MERST); i.e., find a spanning tree of a given graph \(G\) whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.
Kazuhisa Makino +2 more
openaire +3 more sources
Minimum spanning trees in d dimensions
1997Summary: It is shown that a minimum spanning tree of \(n\) points in \(\mathbb{R}^d\) under any fixed \(L_p\)-metric, with \(p= 1,2,\dots,\infty\) can be computed in optimal \(O(T_d(n, n))\) time in the algebraic computational tree model. \(T_d(n, m)\) denotes the time to find a bichromatic closest pair between \(n\) red points and \(m\) blue points ...
Drago Krznaric +2 more
openaire +3 more sources
2019
The atoll of Taka-Tuka-Land in the South Seas asks you for help. The people want to connect their islands by ferry lines. Since money is scarce, the total cost of the connections is to be minimized. It needs to be possible to travel between any two islands; direct connections are not necessary. You are given a list of possible connections together with
Peter Sanders +3 more
openaire +1 more source
The atoll of Taka-Tuka-Land in the South Seas asks you for help. The people want to connect their islands by ferry lines. Since money is scarce, the total cost of the connections is to be minimized. It needs to be possible to travel between any two islands; direct connections are not necessary. You are given a list of possible connections together with
Peter Sanders +3 more
openaire +1 more source
2010
In this chapter, we study the behavior of stochastic search algorithms on an important graph problem. We consider the well-known problem of computing a minimum spanning tree in a given undirected connected graph with n vertices and m edges. The problem has many applications in the area of network design.
Frank Neumann, Carsten Witt
openaire +1 more source
In this chapter, we study the behavior of stochastic search algorithms on an important graph problem. We consider the well-known problem of computing a minimum spanning tree in a given undirected connected graph with n vertices and m edges. The problem has many applications in the area of network design.
Frank Neumann, Carsten Witt
openaire +1 more source
2004
Suppose you have a business with several branch offices and you want to lease phone lines to connect them with each other. Your goal is to connect all your offices with the minimum total cost. The resulting connection should be a spanning tree since if it is not a tree, you can always remove some edges without losing the connectivity to save money.
openaire +2 more sources
Suppose you have a business with several branch offices and you want to lease phone lines to connect them with each other. Your goal is to connect all your offices with the minimum total cost. The resulting connection should be a spanning tree since if it is not a tree, you can always remove some edges without losing the connectivity to save money.
openaire +2 more sources
2013
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +1 more source
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +1 more source
An Optimal Minimum Spanning Tree Algorithm
Journal of the ACM, 2002Vijaya Ramachandran, Seth Pettie
exaly
An Artificial Bee Colony Algorithm for the Leaf-Constrained Minimum Spanning Tree Problem
Applied Soft Computing Journal, 2009Alok Singh
exaly