1002 search results - page 75 / 201 » Towards Graph Programs for Graph Algorithms |
116
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
104
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
133
click to vote
ESA
2004
Springer
15 years 8 months 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...
117
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
143
click to vote
IEEEPACT
1997
IEEE
15 years 6 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...