E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of ACM-SIAM SODA, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....quality of the estimators holds for planar graphs. 118] has presented for planar digraphs a (1 ffl; 0) approximate scheme with O( ffl log n) bit labels, for every ffl 0, to be contrasted with the fact that for ffl = 0 labels must have Omega ) bits [64] Additional results appear in [23,118]. A number of additional approximate distance labeling schemes are presented in [60] including a (1; 2) approximate scheme with O(log n) bit labels for permutation graphs (namely, graphs constructed from a permutation oe on the vertices such that i and j are adjacent iff i j and oe(i) oe(j) ....

....and ancestor queries with 2 log n O(log log n) bit labels [72] Moreover, queries can be answered in constant time on a word RAM computer. A comparative study of ancestor labeling schemes appears in [73] Additional results on labeling schemes (like reachability in planar digraphs) appear in [23,118]. Another example for a piece of non numeric information that may be required in rooted trees is the least common ancestor of v and w. Standard solutions [66,111] can answer such queries in constant time with a suitable preprocessing of the tree, but cannot be applied in a localized computation ....

E. Cohen, E. Halperin, H. Kaplan and U. Zwick. Reachability and Distance Queries via 2-hop Labels. Jan. 2002.

No context found.

E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of ACM-SIAM SODA, 2002.

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