{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T19:38:44Z","timestamp":1758051524747,"version":"3.44.0"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T00:00:00Z","timestamp":1752883200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.dam.2025.07.022","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T10:11:23Z","timestamp":1754302283000},"page":"380-389","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Contractions in perfect graphs"],"prefix":"10.1016","volume":"377","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4207-8948","authenticated-orcid":false,"given":"Alexandre","family":"Dupont-Bouillard","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fouilhoux","sequence":"additional","affiliation":[]},{"given":"Roland","family":"Grappe","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","article-title":"Clique relaxations in social network analysis: The maximum k-plex problem","volume":"59","author":"Balasundaram","year":"2011","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.dam.2025.07.022_b2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0095-8956(90)90077-D","article-title":"Perfectly contractile graphs","volume":"50","author":"Bertschi","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","article-title":"On the complexity of testing for odd holes and induced odd paths","volume":"90","author":"Bienstock","year":"1991","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","article-title":"Induced matchings","volume":"24","author":"Cameron","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2003.05.001","article-title":"Induced matchings in intersection graphs","volume":"278","author":"Cameron","year":"2004","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","article-title":"Finding a maximum induced matching in weakly chordal graphs","volume":"266","author":"Cameron","year":"2003","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.dam.2025.07.022_b7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.14778\/3565816.3565817","article-title":"Efficient maximum K-plex computation over large sparse graphs","volume":"16","author":"Chang","year":"2022","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.dam.2025.07.022_b8","series-title":"P-Matchings Parameterized by Treewidth","first-page":"217","author":"Chaudhary","year":"2023"},{"issue":"03","key":"10.1016\/j.dam.2025.07.022_b9","first-page":"2343","article-title":"Local search with dynamic-threshold configuration checking and incremental neighborhood updating for maximum k-plex problem","volume":"34","author":"Chen","year":"2020","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"year":"2019","series-title":"Combining reinforcement learning and configuration checking for maximum k-plex problem","author":"Chen","key":"10.1016\/j.dam.2025.07.022_b10"},{"key":"10.1016\/j.dam.2025.07.022_b11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. Math."},{"issue":"5","key":"10.1016\/j.dam.2025.07.022_b12","first-page":"1","article-title":"Detecting an odd hole","volume":"67","author":"Chudnovsky","year":"2019","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.dam.2025.07.022_b13","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.jctb.2008.08.002","article-title":"Even pairs in Berge graphs","volume":"99","author":"Chudnovsky","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/j.dam.2025.07.022_b15","series-title":"31st ACM International Conference on Information & Knowledge Management","first-page":"345","article-title":"Scaling up maximal K-plex enumeration","author":"Dai","year":"2022"},{"key":"10.1016\/j.dam.2025.07.022_b16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0012-365X(96)00174-4","article-title":"Path parity and perfection","volume":"165\u2013166","author":"Everett","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.07.022_b17","series-title":"Bonn Workshop on Combinatorial Optimization","first-page":"83","article-title":"Transformations which preserve perfectness and H-perfectness of graphs","volume":"vol. 66","author":"Fonlupt","year":"1982"},{"issue":"2","key":"10.1016\/j.dam.2025.07.022_b18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.dam.2025.07.022_b19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"issue":"18","key":"10.1016\/j.dam.2025.07.022_b20","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.dam.2007.08.006","article-title":"3D-interval-filament graphs","volume":"155","author":"Gavril","year":"2007","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.07.022_b22","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"vol. 88","author":"Gr\u00f6tschel","year":"1984"},{"year":"2022","series-title":"Learning computation bounds for branch-and-bound algorithms to k-plex extraction","author":"Huang","key":"10.1016\/j.dam.2025.07.022_b23"},{"key":"10.1016\/j.dam.2025.07.022_b24","series-title":"Adaptive Agents and Multi-Agent Systems","article-title":"A declarative framework for maximal k-plex enumeration problems","author":"Jabbour","year":"2022"},{"key":"10.1016\/j.dam.2025.07.022_b25","series-title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","first-page":"1689","article-title":"A new upper bound based on vertex partitioning for the maximum K-plex problem","author":"Jiang","year":"2021"},{"key":"10.1016\/j.dam.2025.07.022_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109758","article-title":"Reinforcement learning based coarse-to-fine search for the maximum k-plex problem","volume":"131","author":"Jin","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.dam.2025.07.022_b27","series-title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science","first-page":"20","article-title":"A polynomial algorithm for recognizing perfect graphs","author":"Liu","year":"2003"},{"issue":"1","key":"10.1016\/j.dam.2025.07.022_b28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2005.06.011","article-title":"A class of perfectly contractile graphs","volume":"96","author":"Maffray","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.07.022_b29","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/070687414","article-title":"The Co-2-plex polytope and integral systems","volume":"23","author":"McClosky","year":"2009","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.dam.2025.07.022_b30","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10878-010-9338-2","article-title":"Combinatorial algorithms for the maximum k-plex problem","volume":"23","author":"McClosky","year":"2012","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.dam.2025.07.022_b31","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","article-title":"A new property of critical imperfect graphs and some consequences","volume":"8","author":"Meyniel","year":"1987","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2025.07.022_b32","doi-asserted-by":"crossref","DOI":"10.1007\/s10878-011-9391-5","article-title":"Exact combinatorial algorithms and experiments for finding maximum k-plexes","author":"Moser","year":"2012","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.dam.2025.07.022_b33","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.dam.2008.07.011","article-title":"The parameterized complexity of the induced matching problem","volume":"157","author":"Moser","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.022_b34","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-319-11812-3_21","article-title":"Detecting maximum k-plex with iterative proper l-plex search","author":"Okubo","year":"2014","journal-title":"Discov. Sci."},{"issue":"3","key":"10.1016\/j.dam.2025.07.022_b35","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-020-09459-5","article-title":"Local search for the maximum k-plex problem","volume":"27","author":"Pullan","year":"2021","journal-title":"J. Heuristics"},{"issue":"2","key":"10.1016\/j.dam.2025.07.022_b36","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/jctb.2001.2044","article-title":"About skew partitions in minimal imperfect graphs","volume":"83","author":"Roussel","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.07.022_b37","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","article-title":"A graph-theoretic generalization of the clique concept","volume":"6","author":"Seidman","year":"1978","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.dam.2025.07.022_b38","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s10559-022-00488-5","article-title":"Optimization problems for the maximum k-plex","volume":"58","author":"Stetsyuk","year":"2022","journal-title":"Cybernet. Systems Anal."},{"issue":"8","key":"10.1016\/j.dam.2025.07.022_b39","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.disc.2011.01.013","article-title":"On Roussel\u2013Rubio-type lemmas and their consequences","volume":"311","author":"Trotignon","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.07.022_b40","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jpdc.2017.03.003","article-title":"Parallelizing maximal clique and k-plex enumeration over graph data","volume":"106","author":"Wang","year":"2017","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"10.1016\/j.dam.2025.07.022_b41","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s41019-017-0051-3","article-title":"Query optimal k-plex based community in graphs","volume":"2","author":"Wang","year":"2017","journal-title":"Data Sci. Eng."},{"issue":"05","key":"10.1016\/j.dam.2025.07.022_b42","doi-asserted-by":"crossref","DOI":"10.1142\/S0218213019500155","article-title":"Vertex selection heuristics in branch-and-bound algorithms for the maximum k-plex problem","volume":"28","author":"Wu","year":"2019","journal-title":"Int. J. Artif. Intell. Tools"},{"year":"2023","series-title":"Relaxed graph color bound for the maximum k-plex problem","author":"Zheng","key":"10.1016\/j.dam.2025.07.022_b43"},{"issue":"14","key":"10.1016\/j.dam.2025.07.022_b44","first-page":"12453","article-title":"Improving maximum k-plex solver via second-order reduction and graph color bounding","volume":"35","author":"Zhou","year":"2021","journal-title":"Proc. AAAI Conf. Artif. Intell."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25004135?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25004135?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T04:23:01Z","timestamp":1757823781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25004135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":44,"alternative-id":["S0166218X25004135"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.07.022","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Contractions in perfect graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.07.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}