{"id":"https://openalex.org/W7131640307","doi":"https://doi.org/10.48550/arxiv.2602.21700","title":"Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy","display_name":"Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy","publication_year":2026,"publication_date":"2026-02-25","ids":{"openalex":"https://openalex.org/W7131640307","doi":"https://doi.org/10.48550/arxiv.2602.21700"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.21700","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108089759","display_name":"Kaixin Wang","orcid":"https://orcid.org/0009-0000-6049-0310"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Kaixin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101870536","display_name":"Kaiqiang Yu","orcid":"https://orcid.org/0000-0003-1153-2902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Kaiqiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123124454","display_name":"Cheng Long","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Long, Cheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27253446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4837999939918518,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4837999939918518,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.38089999556541443,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.03359999880194664,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6833000183105469},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6567999720573425},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6200000047683716},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.550000011920929},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4878999888896942},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48420000076293945},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.36559998989105225},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.34209999442100525}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6833000183105469},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6567999720573425},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6200000047683716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.609000027179718},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.550000011920929},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4950999915599823},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4878999888896942},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48420000076293945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42739999294281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39239999651908875},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33149999380111694},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.2635999917984009}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.21700","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.21700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.21700","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.21700","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.811583936214447}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"maximal":[1,104,121,193],"biclique":[2,31],"enumeration":[3],"problem":[4],"in":[5,14,73,113,195],"bipartite":[6],"graphs":[7,247],"is":[8,180,210,217,249],"fundamental":[9],"and":[10,16,64,71,161,187,215],"has":[11],"numerous":[12],"applications":[13],"E-commerce":[15],"transaction":[17],"networks.":[18],"Most":[19],"existing":[20,97,205],"studies":[21],"adopt":[22],"a":[23,29,33,44,53,82,250],"branch-and-bound":[24,84],"framework,":[25],"which":[26,149],"recursively":[27],"expands":[28],"partial":[30],"with":[32,43,152],"vertex":[34],"until":[35],"no":[36,57],"further":[37],"vertices":[38,72],"can":[39,110],"be":[40,111],"added.":[41],"Equipped":[42],"basic":[45],"pivot":[46,146],"selection":[47,147],"strategy,":[48,148],"all":[49,103,204],"state-of-the-art":[50],"methods":[51,98],"have":[52],"worst-case":[54,168,236],"time":[55,115,169,237],"complexity":[56,170,238],"better":[58,159],"than":[59,213],"$O(m\\cdot":[60,172],"(\\sqrt{2})^n)$},":[61],"where":[62,177],"$m$":[63],"$n$":[65],"are":[66],"the":[67,74,92,107,114,118,125,135,138,153,167,181,190,196,230,235],"number":[68,119,127,191],"of":[69,96,120,128,137,185,192,203,232],"edges":[70],"graph,":[75,197],"respectively.":[76,198],"In":[77,88],"this":[78],"paper,":[79],"we":[80,90,142,223],"introduce":[81],"new":[83,139,154],"(BB)":[85],"algorithm":[86],"\\texttt{IPS}.":[87],"\\texttt{IPS},":[89,233],"relax":[91],"strict":[93],"stopping":[94],"criterion":[95],"by":[99],"allowing":[100],"termination":[101,140,155],"when":[102],"bicliques":[105,122,194],"within":[106],"current":[108],"branch":[109],"outputted":[112],"proportional":[116],"to":[117,132,157,171,228,239],"inside,":[123],"reducing":[124],"total":[126],"branches":[129],"required.":[130],"Second,":[131],"fully":[133],"unleash":[134],"power":[136],"condition,":[141],"propose":[143],"an":[144,225],"improved":[145],"well":[150],"aligns":[151],"condition":[156],"achieve":[158],"theoretical":[160],"practical":[162],"performance.":[163],"Formally,":[164],"\\texttt{IPS}":[165],"improves":[166],"\u03b1^n":[173],"+":[174],"n\\cdot":[175],"\u03b2)$,":[176],"$\u03b1(\\approx":[178],"1.3954)$":[179],"largest":[182],"positive":[183],"root":[184],"$x^4-2x-1=0$":[186],"$\u03b2$":[188,216],"represents":[189],"This":[199],"result":[200],"surpasses":[201],"that":[202,208],"algorithms":[206],"given":[207],"$\u03b1$":[209],"strictly":[211],"smaller":[212],"$\\sqrt{2}$":[214],"at":[218],"most":[219],"$(\\sqrt{2})^n-2$":[220],"theoretically.":[221],"Furthermore,":[222],"apply":[224],"inclusion-exclusion-based":[226],"framework":[227],"boost":[229],"performance":[231],"improving":[234],"$O(n\\cdot":[240],"\u03b3^2\\cdot\u03b1^\u03b3+":[241],"\u03b3\\cdot":[242],"\u03b2)$":[243],"for":[244,255],"large":[245],"sparse":[246,256],"($\u03b3$":[248],"parameter":[251],"satisfying":[252],"$\u03b3\\ll":[253],"n$":[254],"graphs).":[257]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-27T00:00:00"}