暂无分享,去创建一个
[1] Mikkel Thorup,et al. Adjacency Labeling Schemes and Induced-Universal Graphs , 2014, STOC.
[2] Stephen Alstrup,et al. Small induced-universal graphs and compact implicit graph representations , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[3] Peter Winkler,et al. Proof of the squashed cube conjecture , 1983, Comb..
[4] Béla Bollobás,et al. Sparse distance preservers and additive spanners , 2003, SODA '03.
[5] David Peleg,et al. Labeling schemes for flow and connectivity , 2002, SODA '02.
[6] Melvin A. Breuer,et al. An unexpected result in coding the vertices of a graph , 1967 .
[7] J. Moon,et al. On minimal n-universal graphs , 1965, Proceedings of the Glasgow Mathematical Association.
[8] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[9] Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.
[10] Haim Kaplan,et al. Compact labeling schemes for ancestor queries , 2001, SODA '01.
[11] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[12] Robert Krauthgamer,et al. Algorithms on negatively curved spaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[13] Takuya Akiba,et al. Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.
[14] Feodor F. Dragan,et al. Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs , 2008, SCG '08.
[15] Andrew V. Goldberg,et al. Hub Labels: Theory and Practice , 2014, SEA.
[16] Ran Raz,et al. Distance labeling in graphs , 2001, SODA '01.
[17] Yang Xiang,et al. A highway-centric labeling approach for answering distance queries on large sparse graphs , 2012, SIGMOD Conference.
[18] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[19] Cyril Gavoille,et al. Distance labeling scheme and split decomposition , 2003, Discret. Math..
[20] Kunal Talwar,et al. Bypassing the embedding: algorithms for low dimensional metrics , 2004, STOC '04.
[21] Michael Elkin,et al. Prioritized Metric Structures and Embedding , 2015, STOC.
[22] Cyril Gavoille,et al. Localized and compact data-structure for comparability graphs , 2005, Discret. Math..
[23] Stephen Alstrup,et al. Simpler, faster and shorter labels for distances in graphs , 2015, SODA.
[24] Bruno Courcelle,et al. Query efficient implementation of graphs of bounded clique-width , 2003, Discret. Appl. Math..
[25] Melvin A. Breuer,et al. Coding the vertexes of a graph , 1966, IEEE Trans. Inf. Theory.
[26] Mikkel Thorup,et al. Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.
[27] Feodor F. Dragan,et al. Distance and routing labeling schemes for non-positively curved plane graphs , 2006, J. Algorithms.
[28] Moni Naor,et al. Implicit representation of graphs , 1992, STOC '88.
[29] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.
[30] David Peleg,et al. Proximity-preserving labeling schemes , 2000, J. Graph Theory.
[31] John Harold Muller,et al. Local structure in graph classes , 1988 .
[32] Cyril Gavoille,et al. Approximate Distance Labeling Schemes , 2000, Electron. Notes Discret. Math..
[33] Mathias Bæk Tejs Knudsen,et al. Optimal Induced Universal Graphs and Adjacency Labeling for Trees , 2015, FOCS.
[34] R. Graham,et al. On embedding graphs in squashed cubes , 1972 .
[35] Cyril Gavoille,et al. Optimal Distance Labeling for Interval Graphs and Related Graph Families , 2008, SIAM J. Discret. Math..