The exact path length problem

Journal of Algorithms

Volumn 42, Issue 1, 2002, Pages 41-53

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

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Graph algorithms; NP completeness; Path problems; Pseudo polynomial time algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

EXACT PATH LENGTH PROBLEM; PSEUDO-POLYNOMIAL TIME ALGORITHMS;

GRAPH THEORY;

EID: 0036462109     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1201     Document Type: Article

References (14)

1. N. Alon, Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, J. Comput. System Sci. 54 (1997), 255-262.
2. D. P. Bertsekas, An auction algorithm for shortest paths. SIAM J. Optim. 1, No. 4, (1991), pp. 425-447.
3. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990). 251-280.
4. T.H. Cormen, C.E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," McGraw-Hill, New York, 1990.
5. H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM J. Comput. 18, No. 5 (1989), 1013-1036.
6. Z. Galil and O. Margalit, All pairs shortest distances for graphs with small integer length edges, J. Comput. System Sci. 54 (1997), 243-254.
7. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
8. G. Grahne and M. Nykänen, Safety, translation and evaluation of alignment calculus, in "Advances in Databases and Information Systems," Electronic Workshops in Computing, pp. 295-304, British Computer Society, 1997. Also available at http://www.ewic.org.uk/ewic/worshop/view.cfm/ADBIS-97.
9. G. Grahne, M. Nykänen, and E. Ukkonen, Reasoning about strings in databases, J. Comput. System Sci. 59 (1999), 116-162.
10. S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7 (1978), 311-324.
11. R. Hakli, M. Nykänen, and H. Tamm, Adding string processing capabilities to data management systems, in "Proceedings of the Seventh International Symposium on String Processing and Information Retrieval (SPIRE 2000)," pp. 122-131, IEEE Computer Society Press, 2000.
12. M. Nykänen, Using acceptors as transducers, Theoret. Comput. Sci., 267, (2001), 83-104.
13. C. H. Papadimitriou and K. Steiglitz, "Combinatorial Optimization: Algorithms and Complexity," Prentice-Hall, New York, 1982.
14. R. Seidel, On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. System Sci. 51 (1995), 400-403.