{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:11Z","timestamp":1725497171571},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"},{"type":"electronic","value":"9783540748397"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74839-7_9","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"86-98","source":"Crossref","is-referenced-by-count":2,"title":["NLC-2 Graph Recognition and Isomorphism"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Limouzy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Math.\u00a037(1), 35\u201350 (1981)","journal-title":"Discrete Math."},{"issue":"2","key":"9_CR2","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. Syst. Sci.\u00a046(2), 218\u2013270 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods\u00a03(2), 214\u2013228 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canad. J. Math.\u00a032, 734\u2013765 (1980)","journal-title":"Canad. J. Math."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms\u00a036(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"9_CR6","first-page":"147","volume":"5","author":"E. Dahlhaus","year":"2002","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Partially complemented representations of digraphs. Discrete Math. Theor. Comput. Sci.\u00a05(1), 147\u2013168 (2002)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"de Montgolfier, F., Rao, M.: The bi-join decomposition. In: ICGT. ENDM, vol.\u00a022, pp. 173\u2013177 (2005)","DOI":"10.1016\/j.endm.2005.06.039"},{"key":"9_CR8","unstructured":"de Montgolfier, F., Rao, M.: Bipartitives families and the bi-join decomposition. Technical report (2005), \n                  \n                    https:\/\/hal.archives-ouvertes.fr\/hal-00132862"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054199000368","volume":"10","author":"J.-L. Fouquet","year":"1999","unstructured":"Fouquet, J.-L., Giakoumakis, V., Vanherpe, J.-M.: Bipartite graphs totally decomposable by canonical decomposition. Internat. J. Found. Comput. Sci.\u00a010(4), 513\u2013533 (1999)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"C.P. Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.-L.: Recognizing circle graphs in polynomial time. J. ACM\u00a036(3), 435\u2013473 (1989)","journal-title":"J. ACM"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11604686_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Gurski","year":"2005","unstructured":"Gurski, F., Wanke, E.: Minimizing NLC-width is NP-Complete. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 69\u201380. Springer, Heidelberg (2005)"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. Internat. J. Found. Comput. Sci.\u00a010(2), 147\u2013170 (1999)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1142\/S0129054100000223","volume":"11","author":"\u00d6. Johansson","year":"2000","unstructured":"Johansson, \u00d6.: NLC\n                  \n                    \n                  \n                  $_{\\mbox{2}}$\n                -decomposition in polynomial time. Internat. J. Found. Comput. Sci.\u00a011(3), 373\u2013395 (2000)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1-3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Math."},{"issue":"2-3","key":"9_CR16","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 Appl. Math.\u00a054(2-3), 251\u2013266 (1994)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T02:37:20Z","timestamp":1539311840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748380","9783540748397"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}