166 search results - page 1 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
STOC
1991
ACM
13 years 8 months ago
1991
ACM
PARA
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
JEA
2006
13 years 4 months ago
2006
WAW
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...