Add to ORKGGiven a connected graph with edge costs, we seek a spanning tree having a specified degree at one vertex r, with cost as small as possible. A previous algorithm, using edge exchanges, has run time 0(V^2); we improve this to 0(E log log V+V log V). Here V and E are the number of vertices and edges. The algorithm uses edge exchanges ordered efficiently on a reduced graph; it also uses efficient algorithms for minimum spanning trees and priority queues
Cataloged from PDF version of article.Given an undirected network with positive edge costs and a pos...
The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree h...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
The purpose of this thesis is to develop a solution to the problem of determining the minimal spanni...
The purpose of this thesis is to develop a solution to the problem of determining the minimal spanni...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning ...
Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning ...
Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degre...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
International audienceGiven a connected edge-weighted graph G and a positive integer B, the degree-c...
In the classical general framework of the minimum spanning tree problem for a weighted graph we cons...
This paper presents two algorithms to construct minimum weight spanning trees with approximately mi...
Cataloged from PDF version of article.Given an undirected network with positive edge costs and a pos...
The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree h...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
The purpose of this thesis is to develop a solution to the problem of determining the minimal spanni...
The purpose of this thesis is to develop a solution to the problem of determining the minimal spanni...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning ...
Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning ...
Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degre...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
International audienceGiven a connected edge-weighted graph G and a positive integer B, the degree-c...
In the classical general framework of the minimum spanning tree problem for a weighted graph we cons...
This paper presents two algorithms to construct minimum weight spanning trees with approximately mi...
Cataloged from PDF version of article.Given an undirected network with positive edge costs and a pos...
The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree h...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...