{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:35Z","timestamp":1746331415045,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_32","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"375-386","source":"Crossref","is-referenced-by-count":6,"title":["Labeling Schemes for Bounded Degree Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Adjiashvili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noy","family":"Rotbart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480103433409","volume":"19","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Disc. Math.\u00a019(2), 448\u2013462 (2005)","journal-title":"SIAM J. Disc. Math."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, pp. 258\u2013264 (2002)","DOI":"10.1145\/564913.564914"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53\u201362. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181882"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/0402014","volume":"2","author":"S. Bhatt","year":"1989","unstructured":"Bhatt, S., Chung, F.R.K., Leighton, T., Rosenberg, A.: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Disc. Math.\u00a02(2), 145\u2013155 (1989)","journal-title":"SIAM J. Disc. Math."},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11780823_12","volume-title":"Structural Information and Communication Complexity","author":"N. Bonichon","year":"2006","unstructured":"Bonichon, N., Gavoille, C., Labourel, A.: Short labels by traversal and jumping. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 143\u2013156. Springer, Heidelberg (2006)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.endm.2007.01.022","volume":"28","author":"N. Bonichon","year":"2007","unstructured":"Bonichon, N., Gavoille, C., Labourel, A.: Short labels by traversal and jumping. Electr. Notes in Discrete Math.\u00a028, 153\u2013160 (2007)","journal-title":"Electr. Notes in Discrete Math."},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00373-009-0860-x","volume":"25","author":"S. Butler","year":"2009","unstructured":"Butler, S.: Induced-universal graphs for graphs with bounded maximum degree. Graphs Combinator.\u00a025(4), 461\u2013468 (2009)","journal-title":"Graphs Combinator."},{"key":"32_CR8","unstructured":"Chung, F.R.K.: Separator theorems and their applications. Forschungsinst. F\u00fcr Diskrete Mathematik (1989)"},{"issue":"4","key":"32_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/jgt.3190140408","volume":"14","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K.: Universal graphs and induced-universal graphs. J. Graph Theor.\u00a014(4), 443\u2013454 (1990)","journal-title":"J. Graph Theor."},{"issue":"5","key":"32_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2008.04.020","volume":"108","author":"L. Esperet","year":"2008","unstructured":"Esperet, L., Labourel, A., Ochem, P.: On induced-universal graphs for the class of bounded-degree graphs. Inform. Process. Lett.\u00a0108(5), 255\u2013260 (2008)","journal-title":"Inform. Process. Lett."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Korman, A.: Compact ancestry labeling schemes for xml trees. In: Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 458\u2013466 (2010)","DOI":"10.1137\/1.9781611973075.38"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Korman, A.: Compact ancestry labeling schemes for xml trees. In: Proc. 21st ACM-SIAM Symp. on Discrete Algorithms, SODA 2010 (2010)","DOI":"10.1137\/1.9781611973075.38"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-540-75520-3_52","volume-title":"Algorithms \u2013 ESA 2007","author":"C. Gavoille","year":"2007","unstructured":"Gavoille, C., Labourel, A.: Shorter implicit representation for planar graphs and bounded treewidth graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 582\u2013593. Springer, Heidelberg (2007)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(03)00232-2","volume":"273","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Math.\u00a0273, 115\u2013130 (2003)","journal-title":"Discrete Math."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: Proc. of the 20th ACM Symposium on Theory of Computing, STOC 1988, pp. 334\u2013343 (1988)","DOI":"10.1145\/62212.62244"},{"key":"32_CR16","unstructured":"Knuth, D.: Combinatorial algorithms. The Art of Computer Programming, vol. 4a (2011)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11940128_42","volume-title":"Algorithms and Computation","author":"A. Korman","year":"2006","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Constructing labeling schemes through universal matrices. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 409\u2013418. Springer, Heidelberg (2006)"},{"key":"32_CR18","unstructured":"Laoutaris, N., Rajaraman, R., Sundaram, R., Teng, S.H.: A bounded-degree network formation game. arXiv preprint cs\/0701071 (2007)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Moon, J.W.: On minimal n-universal graphs. In: Proc. of the Glasgow Math. Assoc. vol.\u00a07, pp. 32\u201333 (1965)","DOI":"10.1017\/S2040618500035139"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"1","author":"C. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a01(1), 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, New York, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"issue":"2","key":"32_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11036-006-4469-5","volume":"11","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., Li, X.Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Networks and Applications\u00a011(2), 161\u2013175 (2006)","journal-title":"Mobile Networks and Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:34Z","timestamp":1746264214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}