C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111--120, 2003.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... schemes were introduced in [33, 41] Since then, adjacency labeling schemes producing small labels have been given for different kinds of sparse graphs, see e.g. 17, 51, 48, 35, 46, 16] A book on implicit graph representation can be found in [49] and an extensive survey on labeling schemes in [30]. To test various kinds of relationships, in addition to adjacency, between two nodes alone from the labels, has been studied in a number of papers: Labeling schemes are given for ancestor in [34, 1, 52, 7, 35, 3] sibling and parent in [35] and distances in [31, 36, 44] Efficient labeling ....

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Technical Report RR-1261-01, Lab. Bordelais de Recherce en Informatique, 2001.

No context found.

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111--120, 2003.

No context found.

C. Gavoille and D. Peleg, Compact and localized distributed data structures, J. of Distributed Computing, 16 (2003), pp. 111--120. PODC 20-Year Special Issue.

No context found.

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111--120, 2003.

No context found.

Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, August 2001.

....computing where individual processor element of a network want to communicate with its neighbors but has not enough local memory resources to store all the underlying topology of the network. Schemes providing compact labels play an important role for localized distributed data structures (see [14] for a survey) 1.1 Related works In this framework, Peleg [24] introduced informative labeling schemes for graphs and thereby captured a whole set of already known results. Among them implicit representation or adjacency labeling [4,18] whose objective is only to decide adjacency between two ....

C. Gavoille and D. Peleg, Compact and localized distributed data structures, Research Report RR-1261-01, LaBRI, University of Bordeaux, Aug. 2001. To appear in J. of Distributed Computing for the PODC 20-Year Special Issue.

....global information. It is clearly a desirable property for a graph in the framework of distributing computing where individual processor element of a network want to communicate with its neighbors but has no enough local memory resources to store all the underlying topology of the network (see [GP01] for an overview) In this spirit, Kannan, Naor, and Rudich [KNR88] have proposed to label each node x of a planar graph by a pair (x; P (x) where P (x) is a set of at most three neighbors of x such that x and y are adjacent if and only if either y 2 P (x) or x 2 P (y) The nodes being ....

Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, August 2001. To appear in Journal of Distributed Computing for the PODC 20-Year Special Issue.

....where individual processor element of a network want to communicate with its neighbors but has not enough local memory resources to store all the underlying topology of the network. Schemes providing compact labels play an important role for localized parallel and distributed data structures (see [GP01b] for a survey) 1.1 Related works In this framework [Pel00a] introduced informative labeling schemes for graphs and thereby captured a whole set of already known results such as implicit representation or adjacency labeling [AR02b, KNR92, Spi02] whose objective is only to decide adjacency ....

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, August 2001. To appear in Journal of Distributed Computing for the PODC 20-Year Special Issue.

....vertices can be tested using the corresponding labels. Other functions can be computed by suitable labeling schemes: ancestry and small distances in trees [2, 20, 21] near common ancestor in trees [1] and other functions [22, 26] A recent overview on compact labeling schemes can be founded in [14]. De nition 1.1 ( 13] Given a family F of connected graphs, an (s; r) approximate distance labeling scheme on F , s; r) approximate DLS for short, is a pair hL; fi, where L is call the labeling function and f the distance decoder, such that for any G 2 F and any pair x; y of distinct vertices ....

C. Gavoille and D. Peleg, Compact and localized distributed data structures, Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, Aug. 2001.

....there is a tree, and a node x of that tree, for which length(address(x) length(data(x) 350 n= log log n) The remaining of the paper is dedicated to proving Theorem 1. The proof is based on the following de nition which belongs to the informative labeling theory (cf. 10, 11, 12] and [9] for an overview) De nition 1 Given a family F of graphs, a forwarding labeling on F is a pair (L; R) where R is called the routing function, and L is called the labeling function. For every G 2 F and every node x of G, L assigns a non empty binary string L(x) to x, and, for any two distinct ....

Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, August 2001.

....routing in trees because it is possible to de ne compact routing scheme on trees that are not along the shortest route, e.g. see [2] The remaining of the paper is dedicated to proving Theorem 1. The proof is based on the following de nition from the informative labeling theory (cf. 10 12] and [9] for an overview) De nition 1. Given a family F of graphs, a forward labeling on F is a pair (L; R) where R is called the routing function, and L is called the labeling function. For every G 2 F and every node x of G, L assigns a non empty binary string L(x) to x, and, for any two distinct ....

Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR1261 -01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, August 2001. To appear in Journal of Distributed Computing.

No context found.

C. Gavoille and D. Peleg, Compact and localized distributed data structures, J. of Distributed Computing, 16 (2003), pp. 111--120. PODC 20-Year Special Issue.

No context found.

C. Gavoille and D. Peleg, Compact and localized distributed data structures, J. of Distributed Computing, 16 (2003), pp. 111-120. PODC 20-Year Special Issue.

No context found.

Cyril Gavoille, David Peleg, \Compact and localized distributed data structures," Distributed Computing Volume 16, Numbers 2-3, September 2003, pp. 111-120.

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