| S. Alstrup and T. Rauhe, Small induced-universal graphs and compact implicit graph representations, in 43 IEEE Symp. on Foundations of Computer Science (FOCS), 2002, pp. 53-62. |
....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 vertex labels, compact routing [11,29] whose objective is to provide the rst edge on a near shortest path between the source and the destination, nearest common ancestor and other related functions for trees [2,3,1,19] used for instance in ....
S. Alstrup and T. Rauhe, Small induced-universal graphs and compact implicit graph representations, in 43 IEEE Symp. on Foundations of Computer Science (FOCS), 2002, pp. 53-62.
....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 between two vertex labels, compact routing [Gav01, TZ01b] whose objective is to provide the rst edge on a near shortest path between the source and the destination, nearest common ancestor and other related functions for trees [ABR03, ....
S. Alstrup and T. Rauhe. Small induced-universal graphs and compact implicit graph representations. In 43 Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, November 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