Search Sciweavers | Sciweavers

1172 search results - page 20 / 235

» Path Algorithms on Regular Graphs

117

click to vote

SODA
2008
ACM

88views Algorithms» more SODA 2008»

A near-linear time algorithm for computing replacement paths in planar directed graphs

15 years 5 months ago

Download www.wisdom.weizmann.ac.il

Yuval Emek, David Peleg, Liam Roditty

claim paper

Read More »

151

Voted

CPC
2007

101views more CPC 2007»

Colouring Random 4-Regular Graphs

15 years 4 months ago

Download www.math.uwaterloo.ca

We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an eﬃcient algorithm which a.a.s. 3colours a random 4-regular ...

Lingsheng Shi, Nicholas C. Wormald

claim paper

Read More »

153

click to vote

HIPC
2007
Springer

392views Distributed And Parallel Com...» more HIPC 2007»

Accelerating Large Graph Algorithms on the GPU Using CUDA

15 years 10 months ago

Download cvit.iiit.ac.in

Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...

Pawan Harish, P. J. Narayanan

claim paper

Read More »

102

click to vote

ICALP
2004
Springer

112views Programming Languages» more ICALP 2004»

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

15 years 9 months ago