{"id":"https://openalex.org/W4283325326","doi":"https://doi.org/10.14778/3529337.3529341","title":"Efficient maximal biclique enumeration for large sparse bipartite graphs","display_name":"Efficient maximal biclique enumeration for large sparse bipartite graphs","publication_year":2022,"publication_date":"2022-04-01","ids":{"openalex":"https://openalex.org/W4283325326","doi":"https://doi.org/10.14778/3529337.3529341"},"language":"en","primary_location":{"id":"doi:10.14778/3529337.3529341","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3529337.3529341","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":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Efficient_Maximal_Biclique_Enumeration_for_Large_Sparse_Bipartite_Graphs/21861984","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Lu Chen","raw_affiliation_strings":["Swinburne University of Technology, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, Melbourne, 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, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, Melbourne, 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, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Swinburne University of Technology, Melbourne, 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/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajie Xu","raw_affiliation_strings":["Soochow University, Suzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]}]},{"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, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deakin University, Melbourne, Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.6799,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97309638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"15","issue":"8","first_page":"1559","last_page":"1571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9894999861717224,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9894999861717224,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9761000275611877,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9567000269889832,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9004116058349609},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.8114839792251587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8038955330848694},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7800347805023193},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6682953238487244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5882143378257751},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.49651676416397095},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48915794491767883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43258368968963623},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4187897741794586},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4124811589717865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32465577125549316},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.20824936032295227},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2069651186466217}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9004116058349609},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.8114839792251587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8038955330848694},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7800347805023193},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6682953238487244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5882143378257751},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.49651676416397095},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48915794491767883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43258368968963623},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4187897741794586},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4124811589717865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32465577125549316},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.20824936032295227},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2069651186466217},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3529337.3529341","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3529337.3529341","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"},{"id":"pmh:oai:figshare.com:article/21861984","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Efficient_Maximal_Biclique_Enumeration_for_Large_Sparse_Bipartite_Graphs/21861984","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/21861984","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Efficient_Maximal_Biclique_Enumeration_for_Large_Sparse_Bipartite_Graphs/21861984","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W169773246","https://openalex.org/W1521732446","https://openalex.org/W1537336823","https://openalex.org/W1584510240","https://openalex.org/W2008088179","https://openalex.org/W2022841964","https://openalex.org/W2036512590","https://openalex.org/W2063498317","https://openalex.org/W2079195756","https://openalex.org/W2100409033","https://openalex.org/W2109291623","https://openalex.org/W2121470019","https://openalex.org/W2125895010","https://openalex.org/W2131776775","https://openalex.org/W2151626491","https://openalex.org/W2160429376","https://openalex.org/W2166661751","https://openalex.org/W2175110005","https://openalex.org/W2205323464","https://openalex.org/W2516280752","https://openalex.org/W2793504318","https://openalex.org/W2884596205","https://openalex.org/W2884850485","https://openalex.org/W2893188841","https://openalex.org/W2906265678","https://openalex.org/W2911528866","https://openalex.org/W2951578870","https://openalex.org/W2962676535","https://openalex.org/W2965557726","https://openalex.org/W2970828623","https://openalex.org/W3003162980","https://openalex.org/W3029150735","https://openalex.org/W3034220763","https://openalex.org/W3034593152","https://openalex.org/W3037117430","https://openalex.org/W3080190857","https://openalex.org/W3142348832","https://openalex.org/W3164681303","https://openalex.org/W3166231268","https://openalex.org/W3174149223","https://openalex.org/W3176857846","https://openalex.org/W4244728719"],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W4400909662","https://openalex.org/W2921162226","https://openalex.org/W3166231268","https://openalex.org/W3042669702","https://openalex.org/W4294294408","https://openalex.org/W2913147187","https://openalex.org/W3037054849","https://openalex.org/W2033371793"],"abstract_inverted_index":{"Maximal":[0,12],"bicliques":[1,24,192],"are":[2,269],"effective":[3],"to":[4,58,71,96,181,204,222,277],"reveal":[5],"meaningful":[6],"information":[7],"hidden":[8],"in":[9,32,36,100,210,227,238],"bipartite":[10,34,43,80,89,150,162],"graphs.":[11,81],"biclique":[13,235],"enumeration":[14,114],"(MBE)":[15],"is":[16,45,50,65,198,236,245,283],"challenging":[17],"since":[18],"the":[19,22,28,37,52,69,74,101,113,170,246,289],"number":[20,29,247],"of":[21,30,68,166,248],"maximal":[23,191,234],"grows":[25],"exponentially":[26],"w.r.t.":[27],"vertices":[31,99],"a":[33,41,86,91,97,117,147,155,159,205,219],"graph":[35,44,163],"worst":[38,53],"case.":[39],"However,":[40],"large":[42,78,87,148,160,275],"usually":[46],"very":[47,121],"sparse,":[48],"which":[49,110,202,230],"against":[51],"case":[54],"and":[55,142,196,273,285],"may":[56,94],"lead":[57],"fast":[59],"MBE":[60,75,207],"algorithms.":[61,291],"The":[62],"uncharted":[63],"opportunity":[64],"taking":[66],"advantage":[67],"sparsity":[70],"substantially":[72],"improve":[73],"efficiency":[76],"for":[77,85,116,133,138,146,158,262],"sparse":[79,88,149,161],"We":[82,216,250],"observe":[83],"that":[84,112,189,232,255,279],"graph,":[90,151],"vertex":[92,103,118,140,174],"u":[93,106],"converge":[95],"few":[98,156],"same":[102],"set":[104,141],"as":[105],"via":[107],"its":[108],"neighbours,":[109],"reveals":[111],"scope":[115],"could":[119,153],"be":[120,154,194],"small.":[122],"Based":[123],"on":[124,271],"this":[125],"observation,":[126],"we":[127],"propose":[128,218],"novel":[129,206,252],"concepts:":[130],"unilateral":[131,136,143,171,177],"coreness":[132,178],"individual":[134],"vertices,":[135],"order":[137],"each":[139],"convergence":[144],"(\u03b6)":[145],"\u03b6":[152,214],"thousand":[157],"with":[164,175],"hundreds":[165],"million":[167],"edges.":[168,249],"Using":[169],"order,":[172],"every":[173,233],"\u03c4":[176,186,197],"only":[179],"needs":[180],"check":[182],"at":[183,259],"most":[184],"2":[185],"combinations":[187],"so":[188],"all":[190,224],"can":[193],"enumerated":[195],"bounded":[199],"by":[200],"\u03b6,":[201],"leads":[203],"algorithm":[208,282],"running":[209],"O":[211,239],"*":[212],"(2":[213],").":[215],"then":[217],"batch-pivots":[220],"technique":[221],"eliminate":[223],"enumerations":[225],"resulting":[226],"non-maximal":[228],"bicliques,":[229],"guarantees":[231],"reported":[237],"(\u03b6":[240],"e":[241,244],")-delay,":[242],"where":[243],"devise":[251],"data":[253],"structures":[254],"allow":[256],"storing":[257],"subgraphs":[258],"omissible":[260],"space":[261],"further":[263],"speeding":[264],"up":[265],"MBE.":[266],"Extensive":[267],"experiments":[268],"conducted":[270],"synthetic":[272],"real":[274],"datasets":[276],"justify":[278],"our":[280],"proposed":[281],"faster":[284],"more":[286],"scalable":[287],"than":[288],"existing":[290]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}