{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:30:56Z","timestamp":1742941856117,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_18","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Tien-Nam","family":"Le","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Perrot","sequence":"additional","affiliation":[]},{"given":"Thi Ha Duong","family":"Phan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"3","key":"18_CR1","first-page":"1031","volume":"2","author":"A Apostolico","year":"2009","unstructured":"Apostolico, A., Drovandi, G.: Graph compression by BFS. Algorithms 2(3), 1031\u20131044 (2009)","journal-title":"Graph compression by BFS. Algorithms"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW 2004, pp. 595\u2013602. ACM (2004)","DOI":"10.1145\/988672.988752"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","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 2(4), 407\u2013429 (2005)","journal-title":"Internet Mathematics"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2009.10390641","volume":"6","author":"P Boldi","year":"2009","unstructured":"Boldi, P., Santini, M., Vigna, S.: Permuting web and social graphs. Internet Mathematics 6(3), 257\u2013283 (2009)","journal-title":"Internet Mathematics"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D Corneil","year":"1981","unstructured":"Corneil, D., Lerchs, H., Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3(3), 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-10217-2_17","volume-title":"Combinatorial Algorithms","author":"C Crespelle","year":"2009","unstructured":"Crespelle, C., Gambette, P.: Efficient neighborhood encoding for interval graphs and permutation graphs and O(n) breadth-first search. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 146\u2013157. Springer, Heidelberg (2009)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.11.036","volume":"522","author":"C Crespelle","year":"2014","unstructured":"Crespelle, C., Gambette, P.: (nearly-)tight bounds on the contiguity and linearity of cographs. Theoretical Computer Science 522, 1\u201312 (2014)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"18_CR8","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 12(4), 459\u2013473 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P Goldberg","year":"1995","unstructured":"Goldberg, P., Golumbic, M., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology 2(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Graph minor theory. Bulletin of the American Mathematical Society 43(1), 75\u201386 (2006)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Maserrat, H., Pei, J.: Neighbor query friendly compression of social networks. In: KDD 2010, pp. 533\u2013542. ACM (2010)","DOI":"10.1145\/1835804.1835873"},{"key":"18_CR12","unstructured":"Roberts, F.: Representations of Indifference Relations. Ph.D. thesis, Stanford University (1968)"},{"key":"18_CR13","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. 8, 289\u2013294 (1984)","journal-title":"Discr. Appl. Math."},{"issue":"17","key":"18_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., Zhao, Y.: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. Discr. Appl. Math. 155(17), 2312\u20132320 (2007)","journal-title":"Discr. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:59:42Z","timestamp":1676973582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}