Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Alon, Noga
Tel-Aviv University
Tel-Aviv, Israel
  Follow this Reviewer
Date Reviewed  
1 review

  On the all-pairs-shortest-path problem
Seidel R.  Theory of computing (, Victoria, British Columbia, Canada,  May 4-6, 1992) 7491992. Type: Proceedings

An ingenious simple trick enables the author to improve a previous result of myself, Z. Galil, and O. Margalit [1] for an interesting special case. He obtains an algorithm that finds the distances between all pairs of vertices of an n
Mar 1 1993  
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy