213 search results - page 4 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
164
Voted
IEICET
2011
14 years 10 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
142
Voted
SAC
2000
ACM
15 years 8 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
153
Voted
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
145
Voted
IPL
2007
15 years 3 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
132
Voted
SRDS
1998
IEEE
15 years 8 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...