{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:57Z","timestamp":1725896397298},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_17","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"146-157","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Gambette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/988672.988752","volume-title":"WWW 2004","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW 2004, pp. 595\u2013602. ACM, New York (2004)"},{"issue":"4","key":"17_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1080\/15427951.2005.10129113","volume":"2","author":"P. Boldi","year":"2005","unstructured":"Boldi, P., Vigna, S.: Codes for the world wide web. Internet Mathematics\u00a02(4), 407\u2013429 (2005)","journal-title":"Internet Mathematics"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"17_CR5","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\u00a012(4), 459\u2013473 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology\u00a02(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, 2nd edn., vol.\u00a057. Elsevier, Amsterdam (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Harel, D.: A linear time algorithm for the lowest common ancestors problem (extended abstract). In: FOCS 1980, pp. 308\u2013319 (1980)","DOI":"10.1109\/SFCS.1980.6"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"17_CR10","unstructured":"Roberts, F.S.: Representations of Indifference Relations. PhD thesis, Stanford University (1968)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations. Fields Institute Monographs, vol.\u00a019. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G. Turan","year":"1984","unstructured":"Turan, G.: On the succinct representation of graphs. Discr. Appl. Math.\u00a08, 289\u2013294 (1984)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM\u00a023(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"},{"issue":"17","key":"17_CR14","doi-asserted-by":"publisher","first-page":"2312","DOI":"10.1016\/j.dam.2007.06.009","volume":"155","author":"R. Wang","year":"2007","unstructured":"Wang, R., Lau, F.C.M., Zhao, Y.: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. Discr. Appl. Math.\u00a0155(17), 2312\u20132320 (2007)","journal-title":"Discr. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:43:31Z","timestamp":1558269811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}