Search w/in this Reviewer for Reviewers All Reviews
	Alon, Noga Tel-Aviv University Tel-Aviv, Israel         Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending 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 Mar 1 1993
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy