221
click to vote
ESA
16 years 24 days ago
2004 Springer 
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
219
click to vote
ESA
16 years 24 days ago
2004 Springer 
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
216
click to vote
ESA
16 years 24 days ago
2004 Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
212
Voted
ESA
16 years 24 days ago
2004 Springer 
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
211
Voted
ESA
16 years 24 days ago
2004 Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
|
Algorithms