{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T03:10:02Z","timestamp":1737342602885,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_43","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"516-528","source":"Crossref","is-referenced-by-count":14,"title":["Distance Labeling Schemes for Well-Separated Graph Classes"],"prefix":"10.1007","author":[{"given":"Michal","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir A.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"43_CR1","unstructured":"C. Gavoille, D. Peleg, S. P\u00e9rennes, and R. Raz. Distance labeling in graphs. In preparation, 1999."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 334\u2013343, May 1988.","DOI":"10.1145\/62212.62244"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"M. Katz, N. Katz and D. Peleg. Distance Labeling Schemes for Well-Separated Graph Classes. Technical Report MCS99-26, the Weizmann Institute of Science, 1999.","DOI":"10.1007\/3-540-46541-3_43"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"D. Peleg. Proximity-preserving labeling schemes and their applications. In Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science, June 1999.","DOI":"10.1007\/3-540-46784-X_5"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"N. Santoro and R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28:5\u20138, 1985.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:07Z","timestamp":1737341767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}