{"id":"https://openalex.org/W4210757530","doi":"https://doi.org/10.14778/3489496.3489497","title":"(p,q)-biclique counting and enumeration for large sparse bipartite graphs","display_name":"(p,q)-biclique counting and enumeration for large sparse bipartite graphs","publication_year":2021,"publication_date":"2021-10-01","ids":{"openalex":"https://openalex.org/W4210757530","doi":"https://doi.org/10.14778/3489496.3489497"},"language":"en","primary_location":{"id":"doi:10.14778/3489496.3489497","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3489496.3489497","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/A5103080319","display_name":"Jianye Yang","orcid":"https://orcid.org/0000-0002-0818-4970"},"institutions":[{"id":"https://openalex.org/I37987034","display_name":"Guangzhou University","ror":"https://ror.org/05ar8rn06","country_code":"CN","type":"education","lineage":["https://openalex.org/I37987034"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianye Yang","raw_affiliation_strings":["Guangzhou University, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"Guangzhou University, Guangzhou, China","institution_ids":["https://openalex.org/I37987034"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009888316","display_name":"Y\u00fcn Peng","orcid":"https://orcid.org/0000-0001-6358-2333"},"institutions":[{"id":"https://openalex.org/I141568987","display_name":"Hong Kong Baptist University","ror":"https://ror.org/0145fw131","country_code":"HK","type":"education","lineage":["https://openalex.org/I141568987"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yun Peng","raw_affiliation_strings":["Hong Kong Baptist University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University, Hong Kong, China","institution_ids":["https://openalex.org/I141568987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100385498","display_name":"Wenjie Zhang","orcid":"https://orcid.org/0000-0001-6572-2600"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103080319"],"corresponding_institution_ids":["https://openalex.org/I37987034"],"apc_list":null,"apc_paid":null,"fwci":3.4124,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.93492543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"15","issue":"2","first_page":"141","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9970999956130981,"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.9970999956130981,"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/T11476","display_name":"Graph theory and applications","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8551489114761353},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8111748695373535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7214845418930054},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.7185500264167786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5815024375915527},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5018680095672607},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4934360086917877},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4892878234386444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47424548864364624},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45742878317832947},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4285615086555481},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4123767018318176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35544514656066895},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33374133706092834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3301035165786743}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8551489114761353},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8111748695373535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7214845418930054},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.7185500264167786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5815024375915527},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5018680095672607},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4934360086917877},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4892878234386444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47424548864364624},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45742878317832947},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4285615086555481},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4123767018318176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35544514656066895},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33374133706092834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3301035165786743},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3489496.3489497","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3489496.3489497","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1576857282","https://openalex.org/W1868111879","https://openalex.org/W1991327379","https://openalex.org/W2013469283","https://openalex.org/W2022996068","https://openalex.org/W2036512590","https://openalex.org/W2054560566","https://openalex.org/W2079535727","https://openalex.org/W2100409033","https://openalex.org/W2110898430","https://openalex.org/W2116007667","https://openalex.org/W2117311203","https://openalex.org/W2145764405","https://openalex.org/W2163970999","https://openalex.org/W2164928285","https://openalex.org/W2266714125","https://openalex.org/W2348679751","https://openalex.org/W2477765720","https://openalex.org/W2762373010","https://openalex.org/W2767249079","https://openalex.org/W2783466287","https://openalex.org/W2787993231","https://openalex.org/W2907379153","https://openalex.org/W2911528866","https://openalex.org/W2963467900","https://openalex.org/W2965557726","https://openalex.org/W3029150735","https://openalex.org/W3037117430","https://openalex.org/W3046691040","https://openalex.org/W3142348832","https://openalex.org/W3166231268","https://openalex.org/W3176857846","https://openalex.org/W4210757530","https://openalex.org/W4212868891"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086","https://openalex.org/W3143578817","https://openalex.org/W4288630335"],"abstract_inverted_index":{"In":[0,148],"this":[1,129,149,258],"paper,":[2,150],"we":[3,37,118,151,199,260],"study":[4,342],"the":[5,107,113,132,141,162,222,253,273,297,319,327,347],"problem":[6,81,130,135],"of":[7,63,82,110,115,145,173,275,335,349],"(":[8,25,55,216],"p":[9,34,193,239],",":[10,28,49,72],"q)-biclique":[11,53,84],"counting":[12,85],"and":[13,30,35,42,76,86,101,125,291,318],"enumeration":[14,87],"for":[15,272],"large":[16],"sparse":[17],"bipartite":[18,22],"graphs.":[19],"Given":[20],"a":[21,51,60,153,166,171,179,209,232,244,250,262,340],"G":[23,48,64],"=":[24,74,78],"U,":[26,68],"V":[27,71,228],"E),":[29],"two":[31],"integer":[32],"parameters":[33],"q,":[36],"aim":[38],"to":[39,112,128,140,183,192,214,237,248,332],"efficiently":[40],"count":[41],"enumerate":[43,215],"all":[44],"(p,":[45,52,83,146,344],"q)-bicliques":[46,345],"in":[47,131,165],"where":[50],"B":[54],"L,":[56],"R":[57,69],")":[58],"is":[59,122,136,190,247,266],"complete":[61],"subgraph":[62,99,299],"with":[65,170,252],"L":[66],"\u2286":[67,70],"|L|":[73],"p,":[75,217],"|R|":[77],"q.":[79,195],"The":[80],"has":[88,231],"many":[89],"applications,":[90,111],"such":[91,295],"as":[92],"graph":[93,277,350],"neural":[94,351],"network":[95],"information":[96],"aggregation,":[97],"densest":[98],"detection,":[100],"cohesive":[102],"subgroup":[103],"analysis,":[104],"etc.":[105],"Despite":[106],"wide":[108],"range":[109],"best":[114],"our":[116,184],"knowledge,":[117],"note":[119],"that":[120,296,323,343],"there":[121],"no":[123],"efficient":[124],"scalable":[126],"solution":[127],"literature.":[133],"This":[134],"computationally":[137],"challenging,":[138],"due":[139],"worst-case":[142,187,233],"exponential":[143,191,236],"number":[144],"q)-bicliques.":[147],"propose":[152,200],"competitive":[154],"branch-and-bound":[155],"baseline":[156,328],"method,":[157],"namely":[158],"BCList,":[159],"which":[160,230,265],"explores":[161],"search":[163,223],"space":[164],"depth-first":[167],"manner,":[168],"together":[169],"variety":[172],"pruning":[174],"techniques.":[175],"Although":[176],"BCList":[177],"offers":[178],"useful":[180],"computation":[181,255,285],"framework":[182],"problem,":[185],"its":[186],"time":[188,234],"complexity":[189,235],"+":[194],"To":[196,257,283],"alleviate":[197],"this,":[198],"an":[201,269],"advanced":[202],"approach,":[203],"called":[204],"BCList++.":[205],"Particularly,":[206],"BCList++":[207,287,324],"applies":[208],"layer":[210,251],"based":[211],"exploring":[212],"strategy":[213],"q":[218,241],")-bicliques":[219],"by":[220,279,305,330],"anchoring":[221],"on":[224,314],"either":[225,238],"U":[226,280],"or":[227,240,281],"only,":[229],"only.":[242],"Consequently,":[243],"vital":[245],"task":[246],"choose":[249],"least":[254],"cost.":[256],"end,":[259],"develop":[261],"cost":[263],"model,":[264],"built":[267],"upon":[268],"unbiased":[270],"estimator":[271],"density":[274],"2-hop":[276],"induced":[278],"V.":[282],"improve":[284],"efficiency,":[286],"exploits":[288],"pre-allocated":[289],"arrays":[290],"vertex":[292],"labeling":[293],"techniques":[294],"frequent":[298],"creating":[300],"operations":[301],"can":[302],"be":[303],"substituted":[304],"array":[306],"element":[307],"switching":[308],"operations.":[309],"We":[310,337],"conduct":[311],"extensive":[312],"experiments":[313],"16":[315],"real-life":[316],"datasets,":[317],"experimental":[320],"results":[321],"demonstrate":[322],"significantly":[325],"outperforms":[326],"methods":[329],"up":[331],"3":[333],"orders":[334],"magnitude.":[336],"show":[338],"via":[339],"case":[341],"optimize":[346],"efficiency":[348],"networks.":[352]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}