Distance and routing labeling schemes for non-positively curved plane graphs

Bakker, 1991, Linear interval routing, Algorithms Rev., 2, 45 Bandelt, 2000, Decomposition and l1-embedding of weakly median graphs, European J. Combin., 21, 701, 10.1006/eujc.1999.0377 H.-J. Bandelt, V. Chepoi, Unpublished manuscript Baues, 2001, Curvature and geometry of tessellating plane graphs, Discrete Comput. Geom., 25, 141, 10.1007/s004540010076 Breuer, 1966, Coding the vertices of a graph, IEEE Trans. Inform. Theory, IT-12, 148, 10.1109/TIT.1966.1053860 Breuer, 1967, An unexpected result on coding the vertices of a graph, J. Math. Anal. Appl., 20, 583, 10.1016/0022-247X(67)90082-0 Chepoi, 1997, Clin d'oeil on L1-embeddable planar graphs, Discrete Appl. Math., 80, 3, 10.1016/S0166-218X(97)00066-8 Chepoi Chepoi, 2003, Interval routing in some planar networks, Theoret. Comput. Sci., 290, 1503, 10.1016/S0304-3975(02)00067-1 Dress, 1987, Gated sets in metric spaces, Aequationes Math., 34, 112, 10.1007/BF01840131 Fraigniaud, 2001, Routing in trees, vol. 2076, 757 Fraigniaud, 2002, A space lower bound for routing in trees, vol. 2285, 65 Frederickson, 1988, Designing networks with compact routing tables, Algorithmica, 3, 171, 10.1007/BF01762113 Gavoille, 1999, A survey on interval routing schemes, Theoret. Comput. Sci., 245, 217, 10.1016/S0304-3975(99)00283-2 Gavoille, 1999, Compact routing tables for graphs of bounded genus, vol. 1644, 351 Gavoille, 2003, Optimal distance labeling schemes, vol. 2832, 254 Gavoille, 2001, Distance labeling in graphs, 210 Harel, 1984, Fast algorithms for finding nearest common ancestor, SIAM J. Comput., 13, 338, 10.1137/0213024 Kannan, 1988, Implicit representation of graphs, 334 Katz, 2000, Distance labeling schemes for well-separated graph classes, vol. 1770, 516 van Leeuwen, 1987, Interval routing, The Computer J., 30, 298, 10.1093/comjnl/30.4.298 Lyndon, 1966, On Dehn's algorithm, Math. Ann., 166, 208, 10.1007/BF01361168 Lyndon, 1967, A maximum principle for graphs, J. Combin. Theory, 3, 34, 10.1016/S0021-9800(67)80013-9 Lyndon, 1977 Narayanan, 1998, Partial characterizations of networks supporting shortest path interval labeling schemes, Networks, 32, 103, 10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-F Peleg, 1999, Proximity-preserving labeling schemes and their applications, vol. 1665, 30 Peleg, 2000, Informative labeling schemes for graphs, vol. 1893, 579 Peleg, 2000 Prisǎcaru, 1990, On embedding of planar graphs into hypercubes, Proc. Moldavian Acad. Sci., Ser. Math., 1, 43 Santoro, 1985, Labeling and implicit routing in networks, The Computer J., 28, 5, 10.1093/comjnl/28.1.5 Spinrad, 2003, Efficient Graph Representations, vol. 19 Soltan, 1973 Thorup, 2001, Compact routing schemes, 1