{"id":"https://openalex.org/W7160408105","doi":"https://doi.org/10.48550/arxiv.2605.03603","title":"Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs","display_name":"Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160408105","doi":"https://doi.org/10.48550/arxiv.2605.03603"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03603","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03603","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.03603","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135525545","display_name":"Mekala Kiran","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kiran, Mekala","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135427588","display_name":"Apurba Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Apurba","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135457675","display_name":"Suman Banerjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Banerjee, Suman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123950021","display_name":"Tathagata Ray","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ray, Tathagata","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5871000289916992,"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.5871000289916992,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.19509999454021454,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.06629999727010727,"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.9510999917984009},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5522000193595886},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5504999756813049},{"id":"https://openalex.org/keywords/signed-graph","display_name":"Signed graph","score":0.4318000078201294},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.3856000006198883},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.3646000027656555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3483999967575073}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9510999917984009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6718000173568726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5774000287055969},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5522000193595886},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5504999756813049},{"id":"https://openalex.org/C2779773260","wikidata":"https://www.wikidata.org/wiki/Q11246292","display_name":"Signed graph","level":3,"score":0.4318000078201294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3937999904155731},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.3646000027656555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.3375999927520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3319999873638153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3163999915122986},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3160000145435333},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2930999994277954},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2842999994754791},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.2833000123500824},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03603","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03603","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.03603","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03603","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Two":[0],"disjoint":[1],"sets":[2],"of":[3,37,100,113,143,220],"entities":[4],"and":[5,40,84,109,145,153,187],"their":[6],"relationship":[7],"can":[8],"be":[9],"modelled":[10],"as":[11,105],"a":[12,66,71,76,148,178,189],"bipartite":[13,41,55,68,102,117,161],"graph.":[14],"Real-life":[15],"examples":[16],"include":[17],"drug-target":[18],"interaction":[19],"in":[20,25,53,65,94,97,127],"biological":[21],"networks,":[22,27,39],"user-item":[23],"relationships":[24],"e-commerce":[26],"etc.":[28],"Motif-based":[29],"analysis":[30,52],"is":[31,70],"essential":[32],"for":[33,140,159],"understanding":[34],"the":[35,95,98,135,155,207,214],"structure":[36],"large-scale":[38],"graphs":[42,56,162],"are":[43,124],"no":[44],"exception.":[45],"In":[46,130],"contrast":[47],"to":[48,163],"unsigned":[49,160],"graphs,":[50,103],"motif":[51,64],"signed":[54,67,101],"has":[57],"received":[58],"limited":[59],"attention.":[60],"The":[61],"smallest":[62],"non-trivial":[63],"graph":[69],"balanced":[72,77,136],"(2,2)-biclique,":[73],"often":[74,125],"called":[75],"butterfly,":[78],"which":[79,123,167],"captures":[80],"only":[81],"local":[82],"patterns":[83],"cannot":[85],"reveal":[86],"higher-order":[87],"relationships.":[88],"Bipartite":[89],"motifs":[90,118],"have":[91],"been":[92],"studied":[93],"literature":[96],"context":[99],"such":[104],"maximal":[106],"biclique,":[107],"bitruss,":[108],"so":[110],"on.":[111],"None":[112],"these":[114],"works":[115],"addresses":[116],"with":[119],"fixed-sized":[120],"vertex":[121,197],"sets,":[122],"relevant":[126],"practical":[128],"situations.":[129],"this":[131],"work,":[132],"we":[133,150,168],"study":[134],"(p,q)-biclique":[137],"counting":[138],"problem":[139],"small":[141],"values":[142],"p":[144],"q.":[146],"As":[147],"baseline,":[149,215],"first":[151],"adapt":[152],"extend":[154],"state-of-the-art":[156],"BCList++":[157],"algorithm":[158],"incorporate":[164],"edge":[165],"signs,":[166],"call":[169],"SBCList++.":[170],"We":[171],"then":[172],"propose":[173],"two":[174],"efficient":[175],"algorithms:":[176],"BBWC,":[177],"wedge-centric":[179],"approach":[180,192],"that":[181,193,206],"enforces":[182],"balance":[183],"constraints":[184],"during":[185],"enumeration,":[186],"BBVP,":[188,211],"vertex-based":[190,208],"pruning":[191,209],"directly":[194],"enumerates":[195],"feasible":[196],"sets.":[198],"Extensive":[199],"experiments":[200],"on":[201],"large":[202],"real-world":[203],"datasets":[204],"demonstrate":[205],"algorithm,":[210],"significantly":[212],"outperforms":[213],"achieving":[216],"an":[217],"average":[218],"speedup":[219],"636$\\times$":[221],"over":[222],"SBCList++":[223],"(where":[224],"p=q=3).":[225]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-07T00:00:00"}