8 search results - page 1 / 2 » On Dynamic Breadth-First Search in External-Memory |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
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...
ICALP
1999
Springer
14 years 1 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
CEC
2010
IEEE
13 years 10 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...