{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:02:36Z","timestamp":1743058956451,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_11","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Graph Parameter to Measure Linearity"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Charbit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lalla","family":"Mouatadid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Naserasr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Charbit, P., Habib, M., Mouatadid, L., Naserasr, R.: A new graph parameter to measure linearity. arXiv preprint arXiv:1702.02133 (2017)","DOI":"10.1007\/978-3-319-71147-8_11"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","volume":"138","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Appl. Math. 138(3), 371\u2013379 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/11083856X","volume":"42","author":"DG Corneil","year":"2013","unstructured":"Corneil, D.G., Dalton, B., Habib, M.: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs. SIAM J. Comput. 42(3), 792\u2013807 (2013)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1137\/15M1012396","volume":"30","author":"DG Corneil","year":"2016","unstructured":"Corneil, D.G., Dusart, J., Habib, M., Kohler, E.: On the power of graph searching for cocomparability graphs. SIAM J. Discret. Math. 30(1), 569\u2013591 (2016)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"G Derek","year":"1999","unstructured":"Derek, G., Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28(4), 1284\u20131297 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR6","first-page":"1905","volume":"23","author":"G Derek","year":"2009","unstructured":"Derek, G., Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discret. Math. 23(4), 1905\u20131953 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-62559-3_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"FF Dragan","year":"1997","unstructured":"Dragan, F.F., Nicolai, F., Brandst\u00e4dt, A.: LexBFS-orderings and powers of graphs. In: d\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 166\u2013180. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62559-3_15"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2015.07.016","volume":"216","author":"J Dusart","year":"2017","unstructured":"Dusart, J., Habib, M.: A new LBFS-based algorithm for cocomparability graph recognition. Discret. Appl. Math. 216, 149\u2013161 (2017)","journal-title":"Discret. Appl. Math."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"CL Monma","year":"1984","unstructured":"Monma, C.L., Trotter, W.T.: Tolerance graphs. Discrete Appl. Math. 9(2), 157\u2013170 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","unstructured":"Habib, M., Mouatadid, L.: Maximum induced matching algorithms via vertex ordering characterizations. In: ISAAC 2017 (2017, to appear)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-08404-6_28","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"E K\u00f6hler","year":"2014","unstructured":"K\u00f6hler, E., Mouatadid, L.: Linear time lexDFS on cocomparability graphs. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 319\u2013330. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_28"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ipl.2015.12.001","volume":"116","author":"E K\u00f6hler","year":"2016","unstructured":"K\u00f6hler, E., Mouatadid, L.: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Inf. Process. Lett. 116(6), 391\u2013395 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0097539703437855","volume":"36","author":"D Kratsch","year":"2006","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. 36(2), 326\u2013353 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkeikerker","year":"1962","unstructured":"Lekkeikerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51(1), 45\u201364 (1962)","journal-title":"Fundamenta Mathematicae"},{"issue":"1\u20133","key":"11_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discret. Math."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"11_CR19","unstructured":"Stacho, J:. Private Communication"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:11:18Z","timestamp":1709809878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}