S. Chaudhuri and C.D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212--226, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Proximity Search in Databases - Goldman, Shivakumar.. (1998) (41 citations) (Correct)
....size. See [GSVGM98] for more detail. There exist linear time algorithms that compute balanced separators for graphs of constant treewidth [Bod96] and for planar graphs [LT80] It can be shown that a balanced separator yields an optimal graph decomposition for in memory distance queries [HKRS94, CZ95, Pel97] Hence, balanced separators would be ideal candidates for hubs. For tree shaped data, such as HTML or XML [Con97] documents, we can use the aforementioned tree based separator algorithm to generate hubs. Unfortunately, for arbitrary graphs, a nontrivial balanced separator theorem does ....
S. Chaudhuri and C. Zaroliagis. Shortest paths in digraphs of small treewidth. In Z. Fulop, editor, Proc. Int. Conference on Automata, Languages and Programming, pages 244--255, Szeged, Hungary, July 1995.
An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (2 citations) Self-citation (Zaroliagis) (Correct)
.... algorithms [13] On the other hand, the development of fully dynamic algorithms for maintenance of various properties on directed graphs (digraphs) turned out to be a much harder problem and much of the research so far was concentrated on the design of partially dynamic algorithms (see e.g. [4, 7, 8, 11, 26, 27, 28, 32]) Only recently, fully dynamic algorithms have started to appear for maintenance of shortest path trees [18, 19, 30] and transitive closure [9, 23, 24, 25] However, despite the number of interesting theoretical results achieved, very little has been done so far with respect to implementations ....
S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27 (3):212-226, 2000, Special Issue on Treewidth, Graph Minors, and Algorithms.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
S. Chaudhuri and C.D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212--226, 2000.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
S. Chaudhuri and C. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212--226, 2000.
Directed Single-Source Shortest-Paths in Linear Average-Case Time - Meyer (2001) (Correct)
No context found.
S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part II : Optimal parallel algorithms. Theoretical Computer Science, 203(2):205--223, 1998.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
S. Chaudhuri and C.D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212--226, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC