Sciweavers

279 search results - page 16 / 56
» Degree-bounded minimum spanning trees
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 7 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
WADS
2007
Springer
77views Algorithms» more  WADS 2007»
14 years 1 months ago
The Stackelberg Minimum Spanning Tree Game
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...