{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:13:29Z","timestamp":1781014409371,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642207112","type":"print"},{"value":"9783642207129","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_18","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"233-246","source":"Crossref","is-referenced-by-count":2,"title":["Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width"],"prefix":"10.1007","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Udi","family":"Rotics","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00224-004-1154-6","volume":"38","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Dragan, F., Le, H.-O., Mosca, R.: New Graph Classes of Bounded Clique-Width. Theory of Computing Systems\u00a038, 623\u2013645 (2005)","journal-title":"Theory of Computing Systems"},{"key":"18_CR3","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":"18_CR4","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the Relationship between Clique-width and Treewidth. SIAM Journal on Computing\u00a034, 825\u2013847 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR5","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. Journal of Computer and System Sciences\u00a046, 218\u2013270 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR6","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 of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"18_CR7","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":"18_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.7155\/jgaa.00065","volume":"7","author":"W. Espelage","year":"2003","unstructured":"Espelage, W., Gurski, F., Wanke, E.: Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications\u00a07, 141\u2013180 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-Width is NP-Complete. SIAM Journal on Discrete Mathematics\u00a023, 909\u2013939 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science\u00a011, 423\u2013443 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR11","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":"18_CR12","unstructured":"Heggernes, P., Meister, D., Papadopoulos, C.: Graphs of small bounded linear clique-width. Technical report\u00a0362 in Informatics, University of Bergen (2007)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-02017-9_27","volume-title":"Theory and Applications of Models of Computation","author":"P. Heggernes","year":"2009","unstructured":"Heggernes, P., Meister, D., Papadopoulos, C.: A Complete Characterisation of the Linear Clique-Width of Path Powers. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 241\u2013250. Springer, Heidelberg (2009)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.-I., Seese, D., Gottlob, G.: Width parameters beyond tree-widthand their applications. The Computer Journal\u00a051, 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M. Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics\u00a0157, 2747\u20132761 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR16","first-page":"39","volume":"132","author":"\u00d6. Johansson","year":"1998","unstructured":"Johansson, \u00d6.: Clique-decomposition, NLC-decomposition, and modular decomposition \u2013 relationships and results for random graphs. Congressus Numerantium\u00a0132, 39\u201360 (1998)","journal-title":"Congressus Numerantium"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-92182-0_76","volume-title":"Algorithms and Computation","author":"V. Lozin","year":"2008","unstructured":"Lozin, V.: From tree-width to clique-width: Excluding a unit interval graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 871\u2013882. Springer, Heidelberg (2008)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.disc.2004.02.008","volume":"283","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics\u00a0283, 151\u2013158 (2004)","journal-title":"Discrete Mathematics"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM Journal on Discrete Mathematics\u00a018, 195\u2013206 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.jctb.2007.04.001","volume":"97","author":"V. Lozin","year":"2007","unstructured":"Lozin, V., Rautenbach, D.: The relative clique-width of a graph. Journal of Combinatorial Theory, Series B\u00a097, 846\u2013858 (2007)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1016\/j.dam.2009.06.024","volume":"158","author":"H. M\u00fcller","year":"2010","unstructured":"M\u00fcller, H., Urner, R.: On a disparity between relative cliquewidth and relative NLC-width. Discrete Applied Mathematics\u00a0158, 828\u2013840 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S.-i. Oum","year":"2006","unstructured":"Oum, S.-i., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B\u00a096, 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:08:48Z","timestamp":1553774928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}