{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:10:34Z","timestamp":1740262234384,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_36","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"402-414","source":"Crossref","is-referenced-by-count":5,"title":["On Compact and Efficient Routing in Certain Graph Classes"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Lomonosov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(96)00091-6","volume":"172","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Nicolai, F.: Homogeneously orderable graphs. Theoretical Computer Science\u00a0172, 209\u2013232 (1997)","journal-title":"Theoretical Computer Science"},{"key":"36_CR2","volume-title":"SIAM Monographs on Discrete Math. Appl.","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Math. Appl., SIAM, Philadelphia (1999)"},{"key":"36_CR3","unstructured":"Dourisboure, Y.: Routage compact et longueur arborescente, PhD Thesis, LaBRI, University of Bordeaux I (December 2003)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-36108-1_17","volume-title":"Distributed Computing","author":"Y. Dourisboure","year":"2002","unstructured":"Dourisboure, Y., Gavoille, C.: Improved Compact Routing Scheme for Chordal Graphs. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 252\u2013264. Springer, Heidelberg (2002)"},{"key":"36_CR5","unstructured":"Dragan, F.F., Lomonosov, I.: New Routing Schemes for Interval Graphs, Circular-Arc Graphs, and Permutation Graphs. In: Proc. of the 14th IASTED Intern. Conf. on Paral. and Distr. Comp. and Syst., Cambridge, USA, pp. 78\u201383 (2003)"},{"key":"36_CR6","unstructured":"Dragan, F.F., Lomonosov, I.: On Compact and Efficient Routing in Certain Graph Classes, TechReport TR-KSU-CS-2004-03, CS Dept., Kent State University, http:\/\/www.cs.kent.edu\/~dragan\/TR-KSU-CS-2004-03.pdf"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column\u00a032 (2001)","DOI":"10.1145\/568438.568451"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","volume":"61","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing\u00a061, 679\u2013687 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Katz, M., Katz, N., Paul, C., Peleg, D.: Approximate distance labeling schemes, Research Report RR-1250-00, LaBRI, University of Bordeaux (December 2000)","DOI":"10.1007\/3-540-44676-1_40"},{"key":"36_CR11","first-page":"125","volume-title":"Proc. of the 15th Annual ACM Symp. on Principles of Distr. Comp","author":"C. Gavoille","year":"1996","unstructured":"Gavoille, C., P\u00e9renn\u00e8s, S.: Memory requirements for routing in distributed networks, In. In: Proc. of the 15th Annual ACM Symp. on Principles of Distr. Comp, pp. 125\u2013133. Pennsylvania, Philadelphia (1996)"},{"key":"36_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal\u00a030, 298\u2013307 (1987)","journal-title":"The Computer Journal"},{"key":"36_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed computing \u2013 A locality-sensitive approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed computing \u2013 A locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labeling and implicit routing in networks. The Computer Journal\u00a028, 5\u20138 (1985)","journal-title":"The Computer Journal"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes, In. In: 13 th Ann. ACM Symp. on Par. Alg. and Arch, July 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: 33 rd Ann. ACM Symp. on Theory of Computing (STOC), July 2001, pp. 183\u2013192.","DOI":"10.1145\/380752.380798"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:21Z","timestamp":1740261141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_36"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}