{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:14Z","timestamp":1725550454676},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_7","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"68-79","source":"Crossref","is-referenced-by-count":0,"title":["Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_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":"7_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":"7_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Inc., Cambridge (2001)","edition":"2"},{"key":"7_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 recognition algorithm for cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(97)00081-1","volume":"62","author":"J.L. Fouquet","year":"1999","unstructured":"Fouquet, J.L., Parfenoff, I., Thuillier, H.: An O(n) time algorithm for maximum matchings in P 4-tidy graphs. Inform. Process. Lett.\u00a062, 281\u2013287 (1999)","journal-title":"Inform. Process. Lett."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","volume":"180","author":"V. Giakoumakis","year":"1997","unstructured":"Giakoumakis, V., Vanherpe, J.: On extended P 4-reducible and extended P 4-sparse graphs. Theoret. Comput. Sci.\u00a0180, 269\u2013286 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"7_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":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"7_CR11","unstructured":"Ho\u00e0ng, C.: Perfect graphs, Ph.D.\u00a0thesis, McGill University, Montreal, Canada (1985)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A tree representation for P 4-sparse graphs. Discrete Appl. Math.\u00a035, 115\u2013129 (1992)","journal-title":"Discrete Appl. Math."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","volume":"61","author":"B. Jamison","year":"1995","unstructured":"Jamison, B., Olariu, S.: Linear-time optimization algorithms for P 4-sparse graphs. Discrete Appl. Math.\u00a061, 155\u2013175 (1995)","journal-title":"Discrete Appl. Math."},{"key":"7_CR14","unstructured":"Lerchs, H.: On cliques and kernels, Technical Report, Department of Computer Science, University of Toronto (March 1971)"},{"key":"7_CR15","unstructured":"McConnell, R.M., Spinrad, J.: Linear time modular decomposition and efficient transitive orientation of comparability graphs. In: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA 1994), pp. 536\u2013545 (1994)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An O( $\\sqrt{n}$ , m) algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual IEEE Symposium on Foundation of Computer Science (FOCS 1980), pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1016\/S0304-3975(02)00068-3","volume":"290","author":"K. Nakano","year":"2003","unstructured":"Nakano, K., Olariu, S., Zomaya, A.Y.: A time-optimal solution for the path cover problem on cographs. Theoret. Comput. Sci.\u00a0290, 1541\u20131556 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0020-0190(93)90230-7","volume":"47","author":"C.-H. Yang","year":"1993","unstructured":"Yang, C.-H., Yu, M.-S.: An O(n) time algorithm for maximum matchings in cographs. Inform. Process. Lett.\u00a047, 89\u201393 (1993)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:06Z","timestamp":1619505666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11573036_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}