Sciweavers

Share
20 search results - page 1 / 4
» Edge Partitioning in External-Memory Graph Search
Sort
View
IJCAI
2007
8 years 8 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
CORR
2008
Springer
107views Education» more  CORR 2008»
8 years 7 months ago
On Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
Ulrich Meyer
AAAI
2004
8 years 8 months ago
Structured Duplicate Detection in External-Memory Graph Search
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
Rong Zhou, Eric A. Hansen
AE
2003
Springer
9 years 16 days ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...
SC
2005
ACM
9 years 26 days ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthď¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
books