{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:04Z","timestamp":1725558964773},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_8","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"93-104","source":"Crossref","is-referenced-by-count":4,"title":["Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-39890-5_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Bretscher","year":"2003","unstructured":"Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A simple linear time lexBFS cograph recognition algorithm. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 119\u2013130. Springer, Heidelberg (2003)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/ISTCS.1997.595165","volume-title":"Fifth Israel Symposium on the Theory of Computing Systems (ISTCS 1997)","author":"C. Capelle","year":"1997","unstructured":"Capelle, C., Habib, M.: Graph decompositions and factorizing permutations. In: Fifth Israel Symposium on the Theory of Computing Systems (ISTCS 1997), pp. 132\u2013143. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03(1), 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"8_CR4","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 time recognition algorithm for cographs. SIAM Journal on Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(90)90131-Z","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Primitivity is hereditary for 2-structures. Theoretical Computer Science\u00a070(3), 343\u2013359 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"8_CR6","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. International Journal of Foundation of Computer Science\u00a010(4), 513\u2013533 (1999)","journal-title":"International Journal of Foundation of Computer Science"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0129054103001625","volume":"14","author":"V. Giakoumakis","year":"2003","unstructured":"Giakoumakis, V., Vanherpe, J.-M.: Linear time recognition and optimizations for weak-bisplit graphs, bi-cographs and bipartite p6-free graphs. International Journal of Foundation of Computer Science\u00a014(1), 107\u2013136 (2003)","journal-title":"International Journal of Foundation of Computer Science"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0097539700372216","volume":"31","author":"P. Hell","year":"2002","unstructured":"Hell, P., Shamir, R., Sharan, R.: A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM Journal on Computing\u00a031(1), 289\u2013305 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR9","unstructured":"Ibarra, L.: Fully dynamic algorithms for chordal graphs. In: 10th ACM-SIAM Annual Symposium on Discrete Algorithm (SODA 2003), pp. 923\u2013924 (1999)"},{"key":"8_CR10","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithm for recognition of interval graphs and permutation graphs. In: 14th ACM-SIAM Annual Symposium on Discrete Algorithm (SODA 2003), pp. 153\u2013167 (2003)"},{"key":"8_CR11","first-page":"3","volume":"81","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Graphical algorithm and their complexity. Mathematical center tracts\u00a081, 3\u201332 (1976)","journal-title":"Mathematical center tracts"},{"key":"8_CR12","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"issue":"2-3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0166-218X(03)00448-7","volume":"136","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and representation of cographs. Discrete Applied Mathematics\u00a0136(2-3), 329\u2013340 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM Journal on Computing\u00a011, 298\u2013313 (1982)","journal-title":"SIAM Journal on Computing"}],"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-30559-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:04Z","timestamp":1620012604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}