{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:47Z","timestamp":1725482207340},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-46784-x_12","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"110-121","source":"Crossref","is-referenced-by-count":2,"title":["NLC2-Decomposition in Polynomial Time"],"prefix":"10.1007","author":[{"given":"\u00d6jvind","family":"Johansson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990. 119"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163\u2013174, 1981. 110, 111","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. G. Corneil","year":"1985","unstructured":"D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14:926\u2013934, 1985. 111","journal-title":"SIAM Journal on Computing"},{"key":"12_CR4","unstructured":"B. Courcelle, J. A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. To appear in Discrete Applied Mathematics. 111, 111"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique width. In Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG\u201998, volume 1517 of Lecture Notes in Computer Science, pages 1\u201316. Springer, 1998. 111","DOI":"10.1007\/10692760_1"},{"key":"12_CR6","unstructured":"Bruno Courcelle and Stephan Olariu. Clique-width: A graph complexity measure-preliminary results and open problems. In Proceedings of the Fifth International Workshop on Graph Grammars and Their Application to Computer Science, 1994. 110, 112"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part i: Clans, basic subclasses, and morphisms. Theoretical Computer Science, 70:277\u2013303, 1990. 115","journal-title":"Theoretical Computer Science"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part ii: Representation through labeled tree families. Theoretical Computer Science, 70:305\u2013342, 1990. 115","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1006\/jagm.1994.1013","volume":"16","author":"A. Ehrenfeucht","year":"1994","unstructured":"Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, and Stephen J. Sullivan. An O(n\n                        2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. Journal of Algorithms, 16:283\u2013294, 1994.","journal-title":"Journal of Algorithms"},{"key":"12_CR10","first-page":"39","volume":"132","author":"\u00d6. Johansson","year":"1998","unstructured":"\u00d6jvind Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition \u2014 relationships and results for random graphs. Congressus Numerantium, 132:39\u201360, 1998. 111, 114, 114","journal-title":"Congressus Numerantium"},{"key":"12_CR11","unstructured":"J. A. Makowsky and U. Rotics. On the clique-width of graphs with few P4\u2019s. To appear in IJFCS. 111"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01206330","volume":"14","author":"R. M. McConnell","year":"1995","unstructured":"R. M. McConnell. An O(n\n                        2) incremental algorithm for modular decomposition of graphs and 2-structures. Algorithmica, 14:229\u2013248, 1995. 115","journal-title":"Algorithmica"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R. H. M\u00f6hring","year":"1985","unstructured":"R. H. M\u00f6hring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research, 4:195\u2013225, 1985\/6. 114","journal-title":"Annals of Operations Research"},{"key":"12_CR14","first-page":"257","volume":"19","author":"R. H. M\u00f6hring","year":"1984","unstructured":"R. H. M\u00f6hring and F. J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics, 19:257\u2013356, 1984.","journal-title":"Annals of Discrete Mathematics"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E. Wanke","year":"1994","unstructured":"Egon Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251\u2013266, 1994. 110, 111, 112, 113, 113","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\/3-540-46784-X_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:00:22Z","timestamp":1578506422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_12"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}