{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:27:23Z","timestamp":1743017243749,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"},{"type":"electronic","value":"9783540748397"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74839-7_8","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"76-85","source":"Crossref","is-referenced-by-count":3,"title":["The Clique-Width of Tree-Power and Leaf-Power Graphs"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Information Processing Letters\u00a098, 113\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Sritharan, R.: Structure and linear time recognition of 4-leaf powers. Manuscript (2005)","DOI":"10.1016\/j.ipl.2006.01.004"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11785293_38","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M.-S. Chang","year":"2006","unstructured":"Chang, M.-S., Ko, M.-T., Lu, H.-I.: Linear-time algorithms for tree root problems. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 411\u2013422. Springer, Heidelberg (2006)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science\u00a0109, 49\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"8_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(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"8_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":"8_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"4","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM Journal on Computing\u00a04, 825\u2013847 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11604686_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Dom","year":"2005","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Extending the tractability border for closest leaf powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 397\u2013408. Springer, Heidelberg (2005)"},{"key":"8_CR10","first-page":"39","volume":"132","author":"\u00d6. Johansson","year":"1998","unstructured":"Johansson, \u00d6.: Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium\u00a0132, 39\u201360 (1998)","journal-title":"Congressus Numerantium"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jda.2005.06.005","volume":"4","author":"W. Kennedy","year":"2006","unstructured":"Kennedy, W., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. Journal of Discrete Algorithms\u00a04(4), 511\u2013525 (2006)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.L. Lin","year":"1995","unstructured":"Lin, Y.L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics\u00a08(1), 99\u2013118 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(94)00023-9","volume":"54","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Applied Mathematics\u00a054(1), 81\u201388 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"56","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers for leaf-labeled trees. Journal of Algorithms\u00a056, 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2006.03.030","volume":"306","author":"D. Rautenbach","year":"2006","unstructured":"Rautenbach, D.: Some remarks about leaf roots. Discrete Mathematics\u00a0306, 1456\u20131461 (2006)","journal-title":"Discrete Mathematics"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D.J. Rose","year":"1974","unstructured":"Rose, D.J.: On simple characterizations of k-trees. Discrete Mathematics\u00a07, 317\u2013322 (1974)","journal-title":"Discrete Mathematics"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/978-3-540-39890-5_32","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"I. Todinca","year":"2003","unstructured":"Todinca, I.: Coloring powers of graphs of bounded clique-width. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 370\u2013382. Springer, Heidelberg (2003)"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E. Wanke","year":"1994","unstructured":"Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics\u00a054, 251\u2013266 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:13:18Z","timestamp":1578517998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_8"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748380","9783540748397"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}