{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:22Z","timestamp":1725543982388},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_20","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"252-265","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Nisse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Rapaport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"Suchan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 188\u2013197 (2006)","DOI":"10.1145\/1146381.1146411"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS), p. 75 (2006)","DOI":"10.1109\/ICDCS.2006.72"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Berry, A., Krueger, R., Simonet, G.: Ultimate generalizations of lexbfs and lex m. In: 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 199\u2013213 (2005)","DOI":"10.1007\/11604686_18"},{"key":"20_CR4","unstructured":"Corneil, D.G., Krueger, R.: A unified view of graph searching. SIAM Journal on Computing (SICOMP)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Gavoille, C.: Improved compact routing scheme for chordal graphs. In: 16th International Conference on Distributed Computing (DISC), pp. 252\u2013264 (2002)","DOI":"10.1007\/3-540-36108-1_17"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.7155\/jgaa.00109","volume":"9","author":"Y. Dourisboure","year":"2005","unstructured":"Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. Journal of Graph Algorithms and Applications (JGAA)\u00a09(2), 277\u2013297 (2005)","journal-title":"Journal of Graph Algorithms and Applications (JGAA)"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.09.002","volume":"57","author":"F.F. Dragan","year":"2005","unstructured":"Dragan, F.F.: Estimating all pairs shortest paths in restricted graph families: a unified approach. Journal of Algorithms\u00a057(1), 1\u201321 (2005)","journal-title":"Journal of Algorithms"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific Journal of Mathematics\u00a015, 835\u2013855 (1965)","journal-title":"Pacific Journal of Mathematics"},{"key":"20_CR9","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":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/11561071_70","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P.: Greedy routing in tree-decomposed graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 791\u2013802. Springer, Heidelberg (2005)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00283-2","volume":"245","author":"C. Gavoille","year":"2000","unstructured":"Gavoille, C.: A survey on interval routing. Theoretical Computer Science (TCS)\u00a0245(2), 217\u2013253 (2000)","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"5","key":"20_CR12","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 for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing (JPDC)\u00a061(5), 679\u2013687 (2001)","journal-title":"Journal of Parallel and Distributed Computing (JPDC)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Perennes, S.: Memory requirements for routing in distributed networks (extended abstract). In: 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 125\u2013133 (1996)","DOI":"10.1145\/248052.248075"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0895480197328631","volume":"12","author":"C. Gavoille","year":"1999","unstructured":"Gavoille, C., Peleg, D.: The compactness of interval routing. SIAM Journal on Discrete Mathematics (SIDMA)\u00a012(4), 459\u2013473 (1999)","journal-title":"SIAM Journal on Discrete Mathematics (SIDMA)"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S0097539799351717","volume":"31","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Peleg, D.: The compactness of interval routing for almost all graphs. SIAM Journal on Computing (SICOMP)\u00a031(3), 706\u2013721 (2001)","journal-title":"SIAM Journal on Computing (SICOMP)"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1006\/jagm.1997.0880","volume":"26","author":"L. Narayanan","year":"1998","unstructured":"Narayanan, L., Nishimura, N.: Interval routing on k-trees. Journal of Algorithms\u00a026(2), 325\u2013369 (1998)","journal-title":"Journal of Algorithms"},{"key":"20_CR18","unstructured":"Nisse, N., Suchan, K., Rapaport, I.: Distributed computing of efficient routing schemes in generalized chordal graphs, http:\/\/www-sop.inria.fr\/members\/Nicolas.Nisse\/publications\/distribRouting.pdf"},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. Journal of the ACM\u00a036(3), 510\u2013530 (1989)","journal-title":"Journal of the ACM"},{"issue":"1","key":"20_CR20","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.: Labelling and implicit routing in networks. The Computer Journal\u00a028(1), 5\u20138 (1985)","journal-title":"The Computer Journal"},{"issue":"6","key":"20_CR21","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM\u00a051(6), 993\u20131024 (2004)","journal-title":"Journal of the ACM"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T05:35:34Z","timestamp":1558762534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}