Author:
Maheshwari Anil,Zeh Norbert
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference45 articles.
1. Abello, J., Buchsbaum, A.L., Westbrook, J.: A functional approach to external graph algorithms. Algorithmica 32(3), 437–458 (2002)
2. Arge, L.: The buffer tree: a technique for designing batched external data structures. Algorithmica 37(1), 1–24 (2003)
3. Arge, L., Zeh, N.: I/O-efficient strong connectivity and depth-first search for directed planar graphs. In: Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pp. 261–270 (2003)
4. Arge, L., Meyer, U., Toma, L., Zeh, N.: On external-memory planar depth first search. J. Graph Algorithms Appl. 7(2), 105–129 (2003)
5. Arge, L., Toma, L., Zeh, N.: I/O-efficient algorithms for planar digraphs. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85–93 (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献