{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:02Z","timestamp":1725512102157},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_29","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"330-341","source":"Crossref","is-referenced-by-count":1,"title":["Graphs of Linear Clique-Width at Most 3"],"prefix":"10.1007","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","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":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/10719839_14","volume-title":"LATIN 2000: Theoretical Informatics","author":"D.G. Corneil","year":"2000","unstructured":"Corneil, D.G., Habib, M., Lanlignel, J.-M., Reed, B.A., Rotics, U.: Polynomial time recognition of clique-width \u2264 3 graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 126\u2013134. Springer, Heidelberg (2000)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J.\u00a0Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J.\u00a0Comput."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci.\u00a046, 218\u2013270 (1993)","journal-title":"J. Comput. System Sci."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width Minimization is NP-hard. In: Proceedings of the thirty-eighth annual ACM Symposium on Theory of Computing, STOC 2006, pp. 354\u2013362 (2006)","DOI":"10.1145\/1132516.1132568"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.disc.2005.11.014","volume":"306","author":"F. Gurski","year":"2006","unstructured":"Gurski, F.: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discrete Mathematics\u00a0306, 271\u2013277 (2006)","journal-title":"Discrete Mathematics"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1016\/j.disc.2006.03.048","volume":"306","author":"F. Gurski","year":"2006","unstructured":"Gurski, F.: Linear layouts measuring neighbourhoods in graphs. Discrete Mathematics\u00a0306, 1637\u20131650 (2006)","journal-title":"Discrete Mathematics"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2005.05.018","volume":"347","author":"F. Gurski","year":"2005","unstructured":"Gurski, F., Wanke, E.: On the relationship between NLC-width and linear NLC-width. Theoretical Computer Science\u00a0347, 76\u201389 (2005)","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","unstructured":"Heggernes, P., Meister, D., Papadopoulos, Ch.: Graphs of small bounded linear clique-width. Technical report, no.362, Institute for Informatics, University of Bergen, Norway (2007)"},{"key":"29_CR12","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Computer Journal (to appear)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM Journal on Discrete Mathematics\u00a06, 400\u2013417 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:17Z","timestamp":1619522057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_29","relation":{},"subject":[]}}