{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:52Z","timestamp":1725552172116},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_19","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:02:01Z","timestamp":1133776921000},"page":"214-226","source":"Crossref","is-referenced-by-count":3,"title":["Adding an Edge in a Cograph"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"19_CR2","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., 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":"19_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00224-003-1074-x","volume":"37","author":"K.W. Chong","year":"2004","unstructured":"Chong, K.W., Nikolopoulos, S.D., Palios, L.: An optimal parallel co-connectivity algorithm. Theory Comput. Systems\u00a037, 527\u2013546 (2004)","journal-title":"Theory Comput. Systems"},{"key":"19_CR4","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 Appl. Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"19_CR5","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 recognition algorithm for cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.46298\/dmtcs.303","volume":"5","author":"E. Dahlhaus","year":"2002","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Partially Complemented Representations of Digraphs. Discrete Math. & Theoret. Comput. Sci.\u00a05, 147\u2013168 (2002)","journal-title":"Discrete Math. & Theoret. Comput. Sci."},{"key":"19_CR7","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 J. Comput.\u00a031, 289\u2013305 (2002)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","unstructured":"Ibarra, L.: Fully dynamic algorithms for chordal graphs. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1999), pp. 923\u2013924 (1999)"},{"key":"19_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., London (1980)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"H.A. Jung","year":"1978","unstructured":"Jung, H.A.: On a class of posets and the corresponding comparability graphs. J.\u00a0Combin. Theory Ser. B\u00a024, 125\u2013133 (1978)","journal-title":"J.\u00a0Combin. Theory Ser. B"},{"key":"19_CR11","unstructured":"Lerchs, H.: On cliques and kernels, Technical Report, Department of Computer Science, University of Toronto (March 1971)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0898-1221(95)00139-P","volume":"30","author":"R. Lin","year":"1995","unstructured":"Lin, R., Olariu, S., Pruesse, G.: An optimal path cover algorithm for cographs. Computers Math. Applic.\u00a030, 75\u201383 (1995)","journal-title":"Computers Math. Applic."},{"key":"19_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 recognition of cographs. Discrete Appl. Math.\u00a0136, 329\u2013340 (2004)","journal-title":"Discrete Appl. Math."},{"key":"19_CR14","volume-title":"Efficient Graph Representations","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1017\/S1446788700029232","volume":"18","author":"D.P. Sumner","year":"1974","unstructured":"Sumner, D.P.: Dacey graphs. J. Austral. Math. Soc.\u00a018, 492\u2013502 (1974)","journal-title":"J. Austral. Math. Soc."}],"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\/11604686_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:08:55Z","timestamp":1683299335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11604686_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}