279 search results - page 16 / 56 » Degree-bounded minimum spanning trees |
116
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
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...
143
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
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...
78
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
