1402 search results - page 21 / 281 » Searching Cycle-Disjoint Graphs |
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
CORR
2010
Springer
15 years 1 months ago
2010
Springer
ACL
2011
14 years 6 months ago
2011
CORR
2008
Springer
15 years 3 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...