213 search results - page 10 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
137
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
143
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
146
click to vote
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
157
click to vote
ICANN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...