{"id":"https://openalex.org/W4393212296","doi":"https://doi.org/10.1145/3639318","title":"Maximum k-Plex Computation: Theory and Practice","display_name":"Maximum k-Plex Computation: Theory and Practice","publication_year":2024,"publication_date":"2024-03-12","ids":{"openalex":"https://openalex.org/W4393212296","doi":"https://doi.org/10.1145/3639318"},"language":"en","primary_location":{"id":"doi:10.1145/3639318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639318","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3639318","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney, Sydney, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6830-3900","affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053363454","display_name":"Kai Yao","orcid":"https://orcid.org/0000-0002-2570-2741"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kai Yao","raw_affiliation_strings":["The University of Sydney, Sydney, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2570-2741","affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":2.8612,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9167686,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.658809244632721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3788430094718933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36192068457603455},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1754242181777954}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.658809244632721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3788430094718933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36192068457603455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1754242181777954}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3639318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639318","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3639318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639318","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1909098149","display_name":null,"funder_award_id":"FT180100256 and DP220103731","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393212296.pdf","grobid_xml":"https://content.openalex.org/works/W4393212296.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1442132175","https://openalex.org/W1539662764","https://openalex.org/W1974939910","https://openalex.org/W2004181701","https://openalex.org/W2017109153","https://openalex.org/W2023536175","https://openalex.org/W2050952499","https://openalex.org/W2078129907","https://openalex.org/W2084512860","https://openalex.org/W2106650313","https://openalex.org/W2110582765","https://openalex.org/W2116007667","https://openalex.org/W2119757574","https://openalex.org/W2169088933","https://openalex.org/W2290805605","https://openalex.org/W2540093921","https://openalex.org/W2588222785","https://openalex.org/W2589796617","https://openalex.org/W2603973660","https://openalex.org/W2742477721","https://openalex.org/W2750598393","https://openalex.org/W2808544634","https://openalex.org/W2809323004","https://openalex.org/W2950303488","https://openalex.org/W2953102514","https://openalex.org/W2998215451","https://openalex.org/W3133302368","https://openalex.org/W3174460405","https://openalex.org/W3191016838","https://openalex.org/W4224316423","https://openalex.org/W4225137014","https://openalex.org/W4295332481","https://openalex.org/W4313049505","https://openalex.org/W4380433193","https://openalex.org/W4381328624","https://openalex.org/W4385767915"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"The":[0],"k-plex":[1,36,47,105,198],"model":[2,6],"relaxes":[3],"the":[4,18,35,38,45,52,58,70,76,103,128,131,140,166,169,174,180,196,218,223,227,260],"clique":[5],"by":[7,172],"allowing":[8],"each":[9],"vertex":[10,19],"to":[11,14,79,137,164,258,285],"miss":[12],"up":[13],"k":[15],"neighbors,":[16],"including":[17],"itself.":[20],"A":[21],"1-plex":[22],"is":[23,85,95,135,201,217,222],"a":[24,86,121,149,160,254],"clique.":[25],"Many":[26],"exact":[27],"algorithms":[28],"have":[29],"been":[30],"recently":[31],"designed":[32],"for":[33],"finding":[34],"with":[37,234],"largest":[39],"number":[40],"of":[41,63,130,168,176,182,226,263],"vertices,":[42],"known":[43],"as":[44,290],"maximum":[46,104,197,224],"computation":[48,106],"problem.":[49],"However,":[50],"all":[51,292],"existing":[53],"algorithms,":[54],"except":[55],"BS,":[56],"has":[57],"trivial":[59],"worst-case":[60],"time":[61,77,133,170,194,213,242,281],"complexity":[62,78,134,171,282],"O*(2n)":[64],"when":[65,139,195,243],"ignoring":[66],"polynomial":[67],"factors.":[68],"On":[69],"other":[71,286],"hand,":[72],"although":[73],"BS":[74],"improves":[75],"O*(\u03b2kn)":[80],"where":[81],"\u03b2k":[82],"<":[83,155],"2":[84],"constant":[87],"depending":[88],"only":[89],"on":[90],"k,":[91],"its":[92],"practical":[93,261,273],"performance":[94,262],"not":[96],"satisfactory.":[97],"In":[98],"this":[99],"paper,":[100],"we":[101,248],"study":[102],"problem":[107],"from":[108,179],"both":[109],"theory":[110],"and":[111,120,125,143,205,220,253,296],"practice.":[112],"We":[113,157,185,230,275],"first":[114],"propose":[115,249],"two":[116],"new":[117,122,141],"reduction":[118,142,251],"rules":[119,145],"branching":[123,144],"rule":[124,252],"prove":[126,186,232],"that":[127,187,233,269,278],"base":[129],"exponential":[132],"reduced":[136],"\u03b3k":[138,154],"are":[146],"incorporated":[147],"into":[148],"standard":[150],"backtracking":[151],"algorithm;":[152],"here":[153],"\u03b2k.":[156],"then":[158],"design":[159],"two-stage":[161],"approach":[162],"kPlexT":[163,188,237,270],"improve":[165,259],"exponent":[167],"separating":[173],"search":[175,181],"large":[177],"k-plexes":[178],"small":[183],"ones.":[184],"runs":[189,238],"in":[190,206,239],"O*((\u03b1":[191,207],"\u0394)k+1":[192,208],"\u03b3_k\u03b1)":[193],"size":[199],"\u03a9k(G)":[200],"at":[202],"least":[203],"2k-1,":[204],"\u03b3_k\u03b1":[209],"+":[210],"min(\u03b3kn,":[211],"n2k-2))":[212],"otherwise;":[214],"here,":[215],"\u03b1":[216],"degeneracy":[219],"\u0394":[221],"degree":[225],"input":[228],"graph.":[229],"also":[231,276],"slight":[235],"modification,":[236],"O*((\u03b1\u0394)k+1":[240],"(k+1)\u03b1+k-\u03a9k(G))":[241],"\u00f8mega_k(G)":[244],"\u2265":[245],"2k-1.":[246],"Finally,":[247],"another":[250],"better":[255],"initialization":[256],"method":[257],"kPlexT.":[264],"Extensive":[265],"empirical":[266],"studies":[267],"demonstrate":[268],"achieves":[271],"state-of-the-art":[272],"performance.":[274],"show":[277],"our":[279],"improved":[280],"carries":[283],"over":[284],"related":[287],"problems":[288],"such":[289],"enumerating":[291],"maximal":[293],"k-plexes,":[294],"quasi-cliques,":[295],"k-biplexes.":[297]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}