Finding paths with the right cost

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 345-355

  Nykänen, Matti ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

ABSOLUTE VALUES; FINDING PATHS; INTEGER VECTORS; NEGATIVE INTEGERS; PSEUDOPOLYNOMIAL ALGORITHMS; RELAXATION ALGORITHM; SHORTEST PATH; WEIGHTED GRAPH;

GRAPH ALGORITHMS;

EID: 22644452524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_32     Document Type: Conference Paper

References (16)

1. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. Journal of Computer and System Sciences, 54:255-262, 1997.
2. D.P. Bertsekas. An auction algorithm for shortest paths. SIAM Journal on Optimization, 1(4):425-447, 1991.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
5. H.N. Gabow and R.E. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18(5):1013-1036, 1989.
6. Z. Galil and O. Margalit. All pairs shortest distances for graphs with small integer length edges. Journal of Computer and System Sciences, 54:243-254, 1997.
7. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
8. G. Grahne and M. Nykänen. Safety, translation and evaluation of Alignment Calculus. In Advances in Databases and Information Systems, Springer Electronic Workshops in Computing, pages 295-304, 1997.
9. G. Grahne, M. Nykänen, and E. Ukkonen. Reasoning about strings in databases. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 303-312, 1994.
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
11. S.R. Kosaraju. Decidability of reachability in vector addition systems. In ACM Symposium on Theory of Computing, pages 267-281, 1982.
12. E.W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal on Computing, 13(3):441-460, 1984.
13. M. Nykänen. Querying String Databases with Modal Logic. PhD thesis, Department of Computer Science, University of Helsinki, Finland, 1997.
14. M. Nykänen. Using acceptors as transducers. In Third International Workshop on Implementing Automata (WIA'98), 1998. In press.
15. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
16. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51:400-403, 1995.