S. Halperin and U. Zwick. Unpublished result, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Simple Linear Time Algorithm for Computing Sparse Spanners.. - Baswana, Sen (Correct)
....Schaffer [11] showed a lower bound of O(n ) on the size of 2 spanner and gave an algorithm for computing a 2 spanner with size matching this lower bound. They also presented an algorithm for computing a 3 spanner of O(n log n) size for chordal graphs. For unweighted graphs, Halperin and Zwick [10, 16] gave an O(m) time algorithm to compute a (2k 1) spanner of O(n ) size. Salowe [14] presented an algorithm for computing a (1 ) spanner of a d dimensional complete Euclidean graph in O(n log n d ) time. However, none of the existing algorithms for these special classes of graphs seem ....
S. Halperin and U. Zwick. Unpublished result. 1996.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) Self-citation (Zwick) (Correct)
No context found.
S. Halperin and U. Zwick. Unpublished result, 1996.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) Self-citation (Zwick) (Correct)
No context found.
S. Halperin and U. Zwick. Unpublished result, 1996.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) Self-citation (Zwick) (Correct)
No context found.
S. Halperin and U. Zwick. Unpublished result, 1996.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) Self-citation (Zwick) (Correct)
No context found.
S. Halperin and U. Zwick. Unpublished result, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC