{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:52Z","timestamp":1725500752884},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_13","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T11:36:53Z","timestamp":1358768213000},"page":"126-136","source":"Crossref","is-referenced-by-count":1,"title":["Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Gambette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","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."},{"key":"13_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":"13_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\u00a02(4), 407\u2013429 (2005)","journal-title":"Internet Mathematics"},{"key":"13_CR4","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.\u00a05874, pp. 146\u2013157. Springer, Heidelberg (2009)"},{"issue":"1","key":"13_CR5","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\u00a02(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"13_CR7","unstructured":"Roberts, F.: Representations of indifference relations, Ph.D. thesis, Stanford University (1968)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Johnson, D., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, vol.\u00a030, pp. 13\u201323 (2004)","DOI":"10.1016\/B978-012088469-8.50005-X"},{"issue":"17","key":"13_CR9","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.\u00a0155(17), 2312\u20132320 (2007)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"13_CR10","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":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","volume":"82","author":"D.H.A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, D.H.A.: Learning decision trees from random examples. Information and Computation\u00a082(3), 231\u2013246 (1989)","journal-title":"Information and Computation"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36494-3_30","volume-title":"STACS 2003","author":"R. Gavald\u00e0","year":"2003","unstructured":"Gavald\u00e0, R., Th\u00e9rien, D.: Algebraic Characterizations of Small Classes of Boolean Functions. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 331\u2013342. Springer, Heidelberg (2003)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L. Lov\u00e1z","year":"2006","unstructured":"Lov\u00e1z, L.: Graph minor theory. Bulletin of the American Mathematical Society\u00a043(1), 75\u201386 (2006)","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:34:52Z","timestamp":1620120892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}