Finding Euler tours in parallel
Journal of Computer and System Sciences
The input/output complexity of sorting and related problems
Communications of the ACM
Introduction to algorithms
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
External-memory exact and approximate all-pairs shortest-paths in undirected graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Computing diameters of huge graphs is a key challenge in complex network analysis. However, since exact diameter computation is computationally too costly, one typically relies on approximations. In fact, already a single BFS run rooted at an arbitrary vertex yields a factor two approximation. Unfortunately, in external-memory, even a simple graph traversal like BFS may cause an unacceptable amount of I/O-operations. Therefore, we investigate alternative approaches with worst-case guarantees on both I/O-complexity and approximation factor.