{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:32Z","timestamp":1725467792463},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056481","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:37:41Z","timestamp":1154248661000},"page":"161-174","source":"Crossref","is-referenced-by-count":1,"title":["The compactness of interval routing for almost all graphs"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"14_CR1","unstructured":"N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley & Sons, 1992."},{"key":"14_CR2","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1975","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, New York, 1975."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"H. Buhrman, J.-H. Hoepman, and P. Vit\u00e1nyi, Optimal routing tables, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), May 1996.","DOI":"10.1145\/248052.248076"},{"key":"14_CR4","unstructured":"H. Buhrman, M. Li, and P. Vit\u00e1nyi, Kolmogorov random graphs and the incompressibility method, in IEEE Conference on Compression and Complexity of Sequences, IEEE Comp. Soc. Press, 1997."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"M. Flammini, J. van Leeuwen, and A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, in 20th International Symposium on Mathematical Foundations of Computer Sciences (MFCS), J. Wiederman and P. H\u00e1jek, eds., vol. 969 of Lecture Notes in Computer Science, Springer-Verlag, Aug. 1995, pp. 37\u201349.","DOI":"10.1007\/3-540-60246-1_111"},{"key":"14_CR6","volume-title":"Research Report RR-1182-97","author":"C. Gavoille","year":"1997","unstructured":"C. Gavoille, A survey on interval routing scheme, Research Report RR-1182-97, LaBRI, University of Bordeaux, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France, Oct. 1997. Submitted for publication."},{"key":"14_CR7","volume-title":"Research Report RR-1176-97","author":"C. Gavoille","year":"1997","unstructured":"C. Gavoille and D. Peleg, The compactness of interval routing, Research Report RR-1176-97, LaBRI, University of Bordeaux, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France, Sept. 1997. Submitted for publication."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"C. Gavoille and S. P\u00e9renn\u00e9s, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., May 1996, pp. 125\u2013133.","DOI":"10.1145\/248052.248075"},{"key":"14_CR9","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 (1985), pp. 5\u20138.","journal-title":"The Computer Journal"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"J. van Leeuwen and R. B. Tan, Interval routing, The Computer Journal, 30 (1987), pp. 298\u2013307.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T11:41:53Z","timestamp":1555760513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0056481","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}