{"id":"https://openalex.org/W3166231268","doi":"https://doi.org/10.1145/3448016.3459241","title":"Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs","display_name":"Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3166231268","doi":"https://doi.org/10.1145/3448016.3459241","mag":"3166231268"},"language":"en","primary_location":{"id":"doi:10.1145/3448016.3459241","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3459241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-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/A5100432046","display_name":"Lu Chen","orcid":"https://orcid.org/0000-0001-5135-9767"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lu Chen","raw_affiliation_strings":["Swinburne University of Technology, , Australia"],"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, , Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028546502","display_name":"Chengfei Liu","orcid":"https://orcid.org/0000-0003-1675-1389"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chengfei Liu","raw_affiliation_strings":["Swinburne University of Technology, , Australia"],"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, , Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032749574","display_name":"Rui Zhou","orcid":"https://orcid.org/0000-0001-6807-4362"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rui Zhou","raw_affiliation_strings":["Swinburne University of Technology, , Australia"],"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, , Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086062267","display_name":"Jiajie Xu","orcid":"https://orcid.org/0000-0001-8227-8636"},"institutions":[{"id":"https://openalex.org/I185940356","display_name":"Soochow University","ror":"https://ror.org/05kvm7n82","country_code":"TW","type":"education","lineage":["https://openalex.org/I185940356"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jiajie Xu","raw_affiliation_strings":["Soochow University, , CN"],"affiliations":[{"raw_affiliation_string":"Soochow University, , CN","institution_ids":["https://openalex.org/I185940356"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100380474","display_name":"Jianxin Li","orcid":"https://orcid.org/0000-0002-9059-330X"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jianxin Li","raw_affiliation_strings":["Deakin University, , Australia"],"affiliations":[{"raw_affiliation_string":"Deakin University, , Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100432046"],"corresponding_institution_ids":["https://openalex.org/I57093077"],"apc_list":null,"apc_paid":null,"fwci":7.0702,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.97499855,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"248","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9936000108718872,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9936000108718872,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9144291281700134},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.7088217735290527},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5965483784675598},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.5745304226875305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5393819808959961},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.5181878209114075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45934468507766724},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44695600867271423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36205658316612244},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3520277440547943},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2973918318748474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26134878396987915},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.23699790239334106}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9144291281700134},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.7088217735290527},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5965483784675598},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5745304226875305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5393819808959961},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.5181878209114075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45934468507766724},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44695600867271423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36205658316612244},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3520277440547943},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2973918318748474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26134878396987915},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23699790239334106}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3448016.3459241","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3459241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4251382304","display_name":null,"funder_award_id":"DP200103700, DP170104747, LP180100750","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G7342200561","display_name":null,"funder_award_id":"61872258","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"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1493217831","https://openalex.org/W1995031045","https://openalex.org/W2021993511","https://openalex.org/W2023159617","https://openalex.org/W2036360385","https://openalex.org/W2037016941","https://openalex.org/W2054265145","https://openalex.org/W2100409033","https://openalex.org/W2109291623","https://openalex.org/W2116007667","https://openalex.org/W2205323464","https://openalex.org/W2487029652","https://openalex.org/W2516280752","https://openalex.org/W2613308084","https://openalex.org/W2771149454","https://openalex.org/W2793504318","https://openalex.org/W2884850485","https://openalex.org/W2896210935","https://openalex.org/W2907594286","https://openalex.org/W2937419751","https://openalex.org/W2950303488","https://openalex.org/W2952145918","https://openalex.org/W3002003116","https://openalex.org/W3005875844","https://openalex.org/W3007971088","https://openalex.org/W3014178346","https://openalex.org/W3034220763","https://openalex.org/W3037117430","https://openalex.org/W3101888373","https://openalex.org/W3151941575","https://openalex.org/W3207515330","https://openalex.org/W6629329278"],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W3042669702","https://openalex.org/W3166231268","https://openalex.org/W2151412766","https://openalex.org/W4294294408","https://openalex.org/W4232683556","https://openalex.org/W2913147187","https://openalex.org/W3037054849","https://openalex.org/W2033371793","https://openalex.org/W2184969544"],"abstract_inverted_index":{"Given":[0],"a":[1,11,25,160,184,190,247],"bipartite":[2,31,59,76,81,101,128,140,166,187,216,251,266],"graph,":[3],"the":[4,21,30,38,41,120,200,221,270],"maximum":[5,22],"balanced":[6],"biclique":[7],"(MBB)":[8],"problem,":[9,43],"discovering":[10],"mutually":[12],"connected":[13],"while":[14],"disjoint":[15],"sets":[16],"of":[17,40,170,193,199,220,255,274],"equal":[18],"size":[19],"with":[20,168,253],"cardinality,":[23],"plays":[24],"significant":[26],"role":[27],"for":[28,61,70,98,106,143,163,214,250],"mining":[29],"graph":[32,188],"and":[33,73,208,234,263,272,278],"has":[34,203],"numerous":[35],"applications.":[36,63],"Despite":[37],"NP-hardness":[39],"MBB":[42,52,95,242],"in":[44,58,90],"this":[45,178,227],"paper,":[46],"we":[47,131,182],"show":[48],"that":[49,103,175,197],"an":[50,83,94,150,241],"exact":[51,67],"can":[53,92,122],"be":[54,134,244],"discovered":[55,245],"extremely":[56],"fast":[57,97,123],"graphs":[60,77,102,129,141,167,217,252,267],"real":[62,264],"We":[64],"propose":[65],"two":[66],"algorithms":[68,277],"dedicated":[69],"small":[71,99],"dense":[72,80,100,127,194,201,215],"large":[74,138,164,185,265],"sparse":[75,139,165,186],"respectively.":[78],"For":[79,137],"graphs,":[82],"O*(1.3803n)":[84],"algorithm":[85,89,153,213],"is":[86,113,154,158],"proposed.":[87],"This":[88,112],"fact":[91],"find":[93],"very":[96],"are":[104,238,259],"common":[105],"applications":[107,144],"such":[108,145,196],"as":[109,146],"VLSI":[110],"design.":[111],"because,":[114],"using":[115],"our":[116,211,275],"proposed":[117,212,276],"novel":[118],"techniques,":[119],"search":[121],"converge":[124],"to":[125,133,177,205,243,268],"sufficiently":[126],"which":[130],"prove":[132],"polynomial-time":[135],"solvable.":[136],"typical":[142],"biological":[147],"data":[148],"analysis,":[149],"O*(1.3803":[151],"\u03b4)":[152],"proposed,":[155,239],"where":[156],"\u03b4":[157,206],"only":[159],"few":[161,248],"hundred":[162],"millions":[169,254],"vertices.":[171,256],"The":[172],"indispensible":[173],"optimization":[174],"leads":[176],"time":[179],"complexity":[180],"is:":[181],"transform":[183],"into":[189],"limited":[191],"number":[192],"subgraphs":[195,202],"each":[198,219],"up":[204,226],"vertices":[207],"then":[209],"apply":[210],"on":[218,261],"subgraphs.":[222],"To":[223],"further":[224],"speed":[225],"algorithm,":[228],"tighter":[229],"upper":[230],"bounds,":[231],"faster":[232],"heuristics":[233],"more":[235],"effective":[236],"reductions":[237],"allowing":[240],"within":[246],"seconds":[249],"Extensive":[257],"experiments":[258],"conducted":[260],"synthetic":[262],"demonstrate":[269],"efficiency":[271],"effectiveness":[273],"techniques.":[279]},"counts_by_year":[{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":22},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}