Sciweavers

1172 search results - page 20 / 235
» Path Algorithms on Regular Graphs
Sort
View
CPC
2007
101views more  CPC 2007»
15 years 6 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
194
Voted
HIPC
2007
Springer
16 years 16 days ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
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
128
Voted
ICALP
2004
Springer
15 years 11 months ago
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
Lars Arge, Ulrich Meyer, Laura Toma
IEICET
2006
52views more  IEICET 2006»
15 years 6 months ago
Node-Disjoint Paths Algorithm in a Transposition Graph
Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori