{"id":"https://openalex.org/W4417070683","doi":"https://doi.org/10.1145/3769833","title":"Theoretically and Practically Efficient Maximum Biclique Search","display_name":"Theoretically and Practically Efficient Maximum Biclique Search","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W4417070683","doi":"https://doi.org/10.1145/3769833"},"language":"en","primary_location":{"id":"doi:10.1145/3769833","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769833","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030519392","display_name":"Qiangqiang Dai","orcid":"https://orcid.org/0000-0002-8569-6558"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiangqiang Dai","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-8569-6558","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100742464","display_name":"Rong-Hua Li","orcid":"https://orcid.org/0000-0001-8658-6599"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong-Hua Li","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-8658-6599","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081418643","display_name":"Lianpeng Qiao","orcid":"https://orcid.org/0000-0002-5401-6222"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lianpeng Qiao","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-5401-6222","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102859035","display_name":"Donghang Cui","orcid":"https://orcid.org/0009-0004-4519-6227"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Donghang Cui","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0004-4519-6227","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054991337","display_name":"Guoren Wang","orcid":"https://orcid.org/0000-0002-0181-8379"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoren Wang","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-0181-8379","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26865304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5478000044822693,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5478000044822693,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.057100001722574234,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05130000039935112,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6880000233650208},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.6067000031471252},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.45260000228881836},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4375},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43320000171661377},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.3930000066757202},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.38179999589920044},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.37540000677108765},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.367900013923645}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6880000233650208},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6067000031471252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5461000204086304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45320001244544983},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.45260000228881836},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4375},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43320000171661377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4316999912261963},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38670000433921814},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.38179999589920044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3779999911785126},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32030001282691956},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.25859999656677246},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769833","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769833","pdf_url":null,"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":null,"license_id":null,"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":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5455532096","display_name":null,"funder_award_id":"62394332, 62402044, U2241211, and 62072034","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W168389790","https://openalex.org/W1521732446","https://openalex.org/W1584510240","https://openalex.org/W1983641062","https://openalex.org/W1984253569","https://openalex.org/W2036360385","https://openalex.org/W2036512590","https://openalex.org/W2061584385","https://openalex.org/W2079195756","https://openalex.org/W2100409033","https://openalex.org/W2105883975","https://openalex.org/W2117311203","https://openalex.org/W2131776775","https://openalex.org/W2150718242","https://openalex.org/W2155181262","https://openalex.org/W2468929674","https://openalex.org/W2793504318","https://openalex.org/W2896210935","https://openalex.org/W2997422757","https://openalex.org/W3007971088","https://openalex.org/W3009094743","https://openalex.org/W3035434998","https://openalex.org/W3037117430","https://openalex.org/W4283325326","https://openalex.org/W4381328624"],"related_works":[],"abstract_inverted_index":{"Identifying":[0],"the":[1,13,73,95,98,145,154,164,229,237,262,283],"maximum":[2,74,99],"edge":[3,75,100],"biclique":[4,76],"in":[5,22,30,51,131],"bipartite":[6,10,132,254],"graphs,":[7,133],"a":[8,19,82,103,116,121,135,168,224],"complete":[9],"subgraph":[11],"with":[12,63],"largest":[14],"number":[15],"of":[16,106,137,147,270,275,280],"edges,":[17],"plays":[18],"crucial":[20],"role":[21],"uncovering":[23],"densely-connected":[24],"communities":[25],"and":[26,36,45,53,67,127,203,215,236,272],"has":[27,167],"significant":[28],"applications":[29],"domains":[31],"such":[32],"as":[33],"recommendation":[34],"systems":[35],"biological":[37],"network":[38],"analysis.":[39],"However,":[40],"this":[41,56,160],"problem":[42],"is":[43,81,115],"NP-hard,":[44],"existing":[46],"methods":[47],"face":[48],"inefficiencies":[49],"both":[50],"practice":[52],"theory.":[54],"In":[55],"paper,":[57],"we":[58,192,222],"propose":[59,223],"two":[60,151],"novel":[61,122],"algorithms":[62,152],"distinct":[64],"branching":[65,85],"strategies":[66],"provable":[68],"time":[69,104,157],"guarantees":[70],"for":[71,97,159,232,240],"solving":[72],"search":[77,96],"problem.":[78,161],"The":[79,113],"first":[80],"refined":[83],"pivot-based":[84,230,284],"algorithm":[86,118,166],"that":[87,119,227,257],"systematically":[88],"exploits":[89],"vertex":[90,129,208],"adjacency":[91],"relationships":[92],"to":[93,183,267,278],"bound":[94],"biclique,":[101],"achieving":[102],"complexity":[105,136],"O":[107,138],"(":[108,139],"m":[109,140],"1.348":[110],"n":[111,142],").":[112,143],"second":[114],"cover-based":[117,165,238],"uncovers":[120],"duality":[123],"between":[124],"maximal":[125],"bicliques":[126],"minimal":[128],"covers":[130],"attaining":[134],"1.381":[141],"To":[144,188],"best":[146],"our":[148,258],"knowledge,":[149],"these":[150],"achieve":[153],"best-known":[155],"worst-case":[156],"complexities":[158],"Notably,":[162],"while":[163],"marginally":[169],"higher":[170],"theoretical":[171],"complexity,":[172],"it":[173],"typically":[174],"provides":[175],"superior":[176],"practical":[177],"performance":[178],"on":[179,251,286],"dense":[180,241,287],"graphs":[181,255],"due":[182],"its":[184],"inherent":[185],"pruning":[186,195],"efficiency.":[187],"further":[189],"enhance":[190],"performance,":[191],"introduce":[193],"advanced":[194],"techniques,":[196],"including":[197],"polynomial-time":[198],"solvable":[199],"graph":[200,234,247],"cases,":[201],"neighbor":[202],"non-neighbor":[204],"constraint-based":[205],"upper":[206,211],"bounds,":[207,212],"cover":[209],"constraint-driven":[210],"heuristic":[213],"prioritization,":[214],"an":[216],"improved":[217],"progressive":[218],"bounding":[219],"approach.":[220],"Additionally,":[221],"hybrid":[225,259],"framework":[226,260],"deploys":[228],"approach":[231,239,285],"sparse":[233],"regions":[235],"regions,":[242],"balancing":[243],"efficiency":[244],"across":[245],"varying":[246],"structures.":[248],"Extensive":[249],"experiments":[250],"12":[252],"real-world":[253],"demonstrate":[256],"outperforms":[261],"state-of-the-art":[263],"baseline":[264],"by":[265],"up":[266],"four":[268],"orders":[269,279],"magnitude":[271,281],"achieves":[273],"speedups":[274],"several":[276],"times":[277],"over":[282],"graphs.":[288]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-06T00:00:00"}