Computing all-pairs shortest paths by leveraging low treewidth

ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Volumn , Issue , 2011, Pages 170-177

  Planken, Léon ^a   De Weerdt, Mathijs ^a   Van Der Krogt, Roman ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; DIRECTED GRAPHS; EFFICIENT ALGORITHM; PATH CONSISTENCY; PLANNING AND SCHEDULING; RUNTIMES; SHORTEST PATH; SIMPLE TEMPORAL PROBLEMS; SPATIAL REASONING; STATE OF THE ART; TREE-WIDTH; VERTEX ORDERING;

ALGORITHMS;

GRAPH THEORY;

EID: 80054832508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Bodlaender, H. L. 1993. A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. In Proc. of the 25th ACM Symposium on the Theory of Computing, 226-234.
2. Bouchitté, V.; Kratsch, D.; Müller, H.; and Todinca, I. 2004. On Treewidth Approximations. Discrete Applied Mathematics 136(2-3): 183-196.
3. Bresina, J. L.; Jónsson, A. K.; Morris, P. H.; and Rajan, K. 2005. Activity Planning for the Mars Exploration Rovers. In Proc. of the 15th Int. Conf. on Automated Planning and Scheduling, 40-49.
4. Bui, H. H., and Yorke-Smith, N. 2010. Efficient Variable Elimination for Semi-Structured Simple Temporal Networks with Continuous Domains. Knowledge Engineering Review 25(3):337-351.
5. Castillo, L.; Fdez-Olivares, J.; and González, A. 2002. A Temporal Constraint Network Based Temporal Planner. In Proc. of the 21st Workshop of the UK Planning and Scheduling Special Interest Group, 99-109.
6. Castillo, L.; Fdez-Olivares, J.; and González, A. 2006. Efficiently Handling Temporal Knowledge in an HTN planner. In Proc. of the 16th Int. Conf. on Automated Planning and Scheduling, 63-72.
7. 3/log n) Time. Algorithmica 50:236-243.
8. Chaudhuri, S., and Zaroliagis, C. D. 2000. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica 27(3):212-226.
9. Chleq, N. 1995. Efficient Algorithms for Networks of Quantitative Temporal Constraints. In Proc. of the 1st Int. Workshop on Constraint Based Reasoning, 40-45.
10. Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2001. Introduction to Algorithms, 2nd edition. MIT Press.
11. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal Constraint Networks. Artificial Intelligence 49(1-3):61-95. (Pubitemid 21679936)
12. Demetrescu, C., and Italiano, G. F. 2006. Fully Dynamic All-Pairs Shortest Paths with Real Edge Weights. Journal of Computer and System Sciences 72(5):813-837. (Pubitemid 44255724)
13. Even, S., and Gazit, H. 1985. Updating Distances in Dynamic Graphs. Methods of Operations Research 49:371-387.
14. Fiedler, N. 2008. Analysis of Java implementations of Fibonacci Heap, http://tinyurl.com/fibo-heap.
15. Fredman, M., and Tarjan, R. E. 1987. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. Journal of the ACM 34(3):596-615.
16. Girvan, M., and Newman, M. E. J. 2002. Community Structure in Social and Biological Networks. Proc. of the National Academy of Sciences of the USA 99(12):7821-7826. (Pubitemid 34650963)
17. Golumbic, M. 2004. Algorithmic Graph Theory and Perfect Graphs. Elsevier.
18. Han, K.; Sekharan, C. N.; and Sridhar, R. 1997. Unified All-Pairs Shortest Path Algorithms in the Chordal Hierarchy. Discrete Applied Mathematics 77(1):59-71. (Pubitemid 127382629)
19. 3/log n)-time Algorithm for All-Pairs Shortest Paths. Information Processing Letters 105(3):114-116.
20. Kjaerulff, U. 1990. Triangulation of Graphs - Algorithms Giving Small Total State Space. Technical report, Aalborg University.
21. 2 n)-time Algorithm. ACM Transactions on Algorithms 6(2): 1-18.
22. Pettie, S. 2004. A New Approach to All-pairs Shortest Paths on Real-weighted Graphs. Theoretical Computer Science 312(1):47-74.
23. 3C: A New Algorithm for the Simple Temporal Problem. In Proc. of the 18th Int. Conf. on Automated Planning and Scheduling, 256-263.
24. Planken, L.; de Weerdt, M.; and Yorke-Smith, N. 2010. Incremental Partial Path Consistency for STP. In Proc. of the 20th Int. Conf. on Automated Planning and Scheduling, 129-136.
25. Ranise, S., and Tinelli, C. 2003. The SMT-LIB Format: An Initial Proposal. In Proc. of Pragmatics of Decision Procedures in Automated Reasoning.
26. Rose, D. J. 1972. A Graph-Theoretic Study of the Numerical Solution of Sparse Positive Definite Systems of Linear Equations. In Read, R., ed., Graph theory and computing. Academic Press. 183-217.
27. Satish Kumar, T. K. 2005. On the Tractability of Restricted Disjunctive Temporal Problems. In Proc. of the 15th Int. Conf. on Automated Planning and Scheduling, 110-119.
28. Shah, J. A., and Williams, B. C. 2008. Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation. In Proc. of the 18th Int. Conf. on Automated Planning and Scheduling, 322-329.
29. Strichman, O.; Seshia, S.A.; and Bryant, R. E. 2002. Deciding Separation Formulas with SAT. In Proc. of the 14th Int. Conf. on Computer Aided Verification, volume 2404 of LNCS, 209-222. Springer.
30. Tarjan, R. E., and Yannakakis, M. 1984. Simple Linear-time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal on Computing 13(3):566-579. (Pubitemid 15514404)
31. Thorup, M. 2004. Fully-dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. In Algorithm Theory, volume 3111 of LNCS, 384-396. Springer.