Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms (1995)

by Shiva Chaudhuri , Christos D. Zaroliagis
Citations:35 - 4 self

Documents Related by Co-Citation

1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
167 Faster Shortest-Path Algorithms for Planar Graphs – Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian - 1994
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
102 Distance Labeling in Graphs – Cyril Gavoille, David Peleg, Stéphane, Pérennes, Ran Raz - 2000
89 Compact oracles for reachability and approximate distances in planar digraphs – M Thorup
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
190 A linear-time algorithm for finding tree-decompositions of small treewidth – H L Bodlaender - 1996
23 Proximity-preserving labeling schemes – D Peleg - 2000
40 Approximate distance oracles for unweighted graphs in expected o(n2) time – S Baswana, S Sen - 2006
175 On sparse spanners of weighted graphs – I Althöfer, G Das, D P Dobkin, D Joseph, J Soares
282 On lipschitz embedding of finite metric spaces in hilbert space – J Bourgain - 1985
42 D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks – R Geisberger, P Sanders, D Schultes, Delling - 2008
18 Preprocessing an undirected planar network to enable fast approximate distance queries – Philip N Klein - 2002
67 Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs – Valerie King - 1999
255 A Partial K-Arboretum of Graphs With Bounded Treewidth – Hans L. Bodlaender - 1998
2 Proximity search in databases. (Extended Version – R Goldman, N Shivakumar, S Venkatasubramanian, H Garcia-Molina - 1998
2 Managing text with Oracle8 ConText cartridge. http://www.oracle.com/st/o8collateral/html/xctx5bwp.html – Oracle Corp - 1997
24 Integrating SQL databases with content specific search engines – S Dessloch, N Mattos - 1997
40 The input/output complexity of transitive closure – J D Ullman, M Yannakakis - 1991