16 search results - page 1 / 4 » Competitive Maintenance of Minimum Spanning Trees in Dynamic... |
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
CORR
2008
Springer
13 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...
ICALP
1997
Springer
13 years 8 months ago
1997
Springer
ACID
2006
13 years 5 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
ICIP
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...