{"id":"https://openalex.org/W4313049505","doi":"https://doi.org/10.14778/3565816.3565817","title":"Efficient maximum <i>k</i> -plex computation over large sparse graphs","display_name":"Efficient maximum <i>k</i> -plex computation over large sparse graphs","publication_year":2022,"publication_date":"2022-10-01","ids":{"openalex":"https://openalex.org/W4313049505","doi":"https://doi.org/10.14778/3565816.3565817"},"language":"en","primary_location":{"id":"doi:10.14778/3565816.3565817","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3565816.3565817","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"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, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035486744","display_name":"Mouyi Xu","orcid":"https://orcid.org/0009-0000-2782-4331"},"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":"Mouyi Xu","raw_affiliation_strings":["The University of Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066225806","display_name":"Darren Strash","orcid":"https://orcid.org/0000-0001-7095-8749"},"institutions":[{"id":"https://openalex.org/I188592606","display_name":"Hamilton College","ror":"https://ror.org/05709zb94","country_code":"US","type":"education","lineage":["https://openalex.org/I188592606"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darren Strash","raw_affiliation_strings":["Hamilton College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hamilton College","institution_ids":["https://openalex.org/I188592606"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2513,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.89633416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"2","first_page":"127","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/adjacency-matrix","display_name":"Adjacency matrix","score":0.5447491407394409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5267726182937622},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5173134803771973},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47538864612579346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45896032452583313},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43365025520324707},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4140642583370209},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4092479944229126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3349177837371826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32345378398895264}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5447491407394409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5267726182937622},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5173134803771973},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47538864612579346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45896032452583313},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43365025520324707},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4140642583370209},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4092479944229126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3349177837371826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32345378398895264},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3565816.3565817","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3565816.3565817","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1442132175","https://openalex.org/W1539662764","https://openalex.org/W1594785451","https://openalex.org/W1594951361","https://openalex.org/W1823437338","https://openalex.org/W1903894141","https://openalex.org/W1974939910","https://openalex.org/W1980096229","https://openalex.org/W1983402337","https://openalex.org/W2004181701","https://openalex.org/W2017109153","https://openalex.org/W2026320281","https://openalex.org/W2046112356","https://openalex.org/W2050952499","https://openalex.org/W2078129907","https://openalex.org/W2094224753","https://openalex.org/W2116007667","https://openalex.org/W2148606255","https://openalex.org/W2169088933","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/W3174460405","https://openalex.org/W3191016838","https://openalex.org/W4224316423","https://openalex.org/W4295332481","https://openalex.org/W6639897565"],"related_works":["https://openalex.org/W2132137594","https://openalex.org/W2069783012","https://openalex.org/W2085967955","https://openalex.org/W3098612666","https://openalex.org/W2138867060","https://openalex.org/W2023859141","https://openalex.org/W2182290077","https://openalex.org/W1499116563","https://openalex.org/W4206067440","https://openalex.org/W4301046126"],"abstract_inverted_index":{"The":[0],"k":[1,19,30,65,81],"-plex":[2,31,66,82],"model":[3,10],"is":[4],"a":[5,28,33,58,75,105,132,139,158,170],"relaxation":[6],"of":[7,99,207],"the":[8,42,63,100,118,144,154,176,183,223,229,244],"clique":[9],"by":[11,87,104,122,191],"allowing":[12],"every":[13],"vertex":[14,125,159],"to":[15,18,49,116,152,220],"miss":[16],"up":[17],"neighbors.":[20],"Designing":[21],"exact":[22],"and":[23,95,127,136,163,195,202,211,225,249],"efficient":[24,112],"algorithms":[25,44,246],"for":[26,62,78,209],"computing":[27,79],"maximum":[29,64,80],"in":[32,54],"graph":[34,120,135,156,190],"has":[35,138,160],"been":[36,161],"receiving":[37],"increasing":[38],"interest":[39],"recently.":[40],"However,":[41],"existing":[43,145],"are":[45,180,218],"still":[46],"inefficient":[47],"due":[48],"having":[50],"major":[51],"limitations.":[52],"We":[53],"this":[55],"paper":[56],"design":[57],"new":[59,76],"algorithm":[60,114,172,241],"kPlexS":[61,242],"problem,":[67],"with":[68],"three":[69],"novel":[70],"contributions.":[71],"Firstly,":[72],"we":[73,109,148,168],"propose":[74,110],"framework":[77],"over":[83],"large":[84,235],"sparse":[85],"graphs,":[86],"iteratively":[88,149],"extracting":[89],"small":[90],"dense":[91,102,177],"subgraphs":[92,103,178],"from":[93,165,182],"it":[94],"then":[96],"solving":[97],"each":[98],"extracted":[101,181],"branch-and-bound":[106,171],"search.":[107],"Secondly,":[108],"an":[111,192],"reduction":[113,126,210,224],"CTCP":[115,130,151],"reduce":[117,153],"input":[119,155,184,189],"size":[121],"exhaustively":[123],"conducting":[124],"edge":[128],"reduction.":[129],"computes":[131],"smaller":[133],"reduced":[134],"also":[137],"lower":[140],"time":[141],"complexity":[142],"than":[143],"techniques.":[146],"Moreover,":[147],"invoke":[150],"once":[157],"processed":[162],"removed":[164],"it.":[166],"Thirdly,":[167],"develop":[169],"BBMatrix":[173,186],"specifically":[174],"targeting":[175],"that":[179,239],"graph.":[185],"represents":[187],"its":[188],"adjacency":[193],"matrix,":[194],"utilizes":[196],"both":[197],"first-order":[198],"(i.e.,":[199,205],"individual":[200],"vertices)":[201,208],"second-order":[203],"information":[204],"pairs":[206],"upper":[212,226],"bounding.":[213],"In":[214],"addition,":[215],"incremental":[216],"techniques":[217],"proposed":[219],"efficiently":[221],"apply":[222],"bounding":[227],"during":[228],"recursion.":[230],"Extensive":[231],"empirical":[232],"studies":[233],"on":[234],"real":[236],"graphs":[237],"demonstrate":[238],"our":[240],"outperforms":[243],"state-of-the-art":[245],"BnB,":[247],"Maplex,":[248],"KpLeX.":[250]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}