{"id":"https://openalex.org/W3158752840","doi":"https://doi.org/10.1109/tkde.2021.3077071","title":"On Efficient Large Maximal Biplex Discovery","display_name":"On Efficient Large Maximal Biplex Discovery","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3158752840","doi":"https://doi.org/10.1109/tkde.2021.3077071","mag":"3158752840"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2021.3077071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2021.3077071","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","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/A5101870536","display_name":"Kaiqiang Yu","orcid":"https://orcid.org/0000-0003-1153-2902"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Kaiqiang Yu","raw_affiliation_strings":["School of Computer Science and Engineering, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: kaiqiang002@e.ntu.edu.sg)","[School of Computer Science and Engineering, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: kaiqiang002@e.ntu.edu.sg)]"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: kaiqiang002@e.ntu.edu.sg)","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"[School of Computer Science and Engineering, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: kaiqiang002@e.ntu.edu.sg)]","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044528555","display_name":"Cheng Long","orcid":"https://orcid.org/0000-0001-6806-8405"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Cheng Long","raw_affiliation_strings":["SCSE, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: C.LONG@NTU.EDU.SG)","[SCSE, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: C.LONG@NTU.EDU.SG)]"],"affiliations":[{"raw_affiliation_string":"SCSE, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: C.LONG@NTU.EDU.SG)","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"[SCSE, Nanyang Technological University, 54761 Singapore, Singapore, Singapore, 639798 (e-mail: C.LONG@NTU.EDU.SG)]","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113740386","display_name":"P Deepak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096394","display_name":"Queens University","ror":"https://ror.org/00strmv13","country_code":"BD","type":"education","lineage":["https://openalex.org/I4210096394"]},{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["BD","GB"],"is_corresponding":false,"raw_author_name":"Deepak P","raw_affiliation_strings":["School of Electronics, Electrical Engineering and Computer Science, Queens University Belfast, Belfast, Belfast, United Kingdom of Great Britain and Northern Ireland, (e-mail: deepaksp@acm.org)","[School of Electronics, Electrical Engineering and Computer Science, Queens University Belfast, Belfast, Belfast, United Kingdom of Great Britain and Northern Ireland, (e-mail: deepaksp@acm.org)]"],"affiliations":[{"raw_affiliation_string":"School of Electronics, Electrical Engineering and Computer Science, Queens University Belfast, Belfast, Belfast, United Kingdom of Great Britain and Northern Ireland, (e-mail: deepaksp@acm.org)","institution_ids":["https://openalex.org/I4210096394","https://openalex.org/I126231945"]},{"raw_affiliation_string":"[School of Electronics, Electrical Engineering and Computer Science, Queens University Belfast, Belfast, Belfast, United Kingdom of Great Britain and Northern Ireland, (e-mail: deepaksp@acm.org)]","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046521217","display_name":"Tanmoy Chakraborty","orcid":"https://orcid.org/0000-0002-0210-0369"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tanmoy Chakraborty","raw_affiliation_strings":["Computer Science and Engineering Department, Indraprastha Institute of Information Technology, Delhi (IIIT-D), New Delhi, India, India, (e-mail: tanmoy@iiitd.ac.in)","[Computer Science and Engineering Department, Indraprastha Institute of Information Technology, Delhi (IIIT-D), New Delhi, India, India, (e-mail: tanmoy@iiitd.ac.in)]"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Indraprastha Institute of Information Technology, Delhi (IIIT-D), New Delhi, India, India, (e-mail: tanmoy@iiitd.ac.in)","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"[Computer Science and Engineering Department, Indraprastha Institute of Information Technology, Delhi (IIIT-D), New Delhi, India, India, (e-mail: tanmoy@iiitd.ac.in)]","institution_ids":["https://openalex.org/I119939252"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101870536"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":4.6821,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.95025587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6995565891265869},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6420121788978577},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6061524152755737},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5408923625946045},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5251678824424744},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.48904189467430115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4603232443332672},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.43842029571533203},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.43271148204803467},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42059099674224854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.401159405708313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36969923973083496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27786338329315186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24015206098556519}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6995565891265869},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6420121788978577},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6061524152755737},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5408923625946045},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5251678824424744},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.48904189467430115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4603232443332672},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.43842029571533203},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.43271148204803467},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42059099674224854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.401159405708313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36969923973083496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27786338329315186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24015206098556519},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tkde.2021.3077071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2021.3077071","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/d43f47bf-3704-44d2-a551-534e69002cb4","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/d43f47bf-3704-44d2-a551-534e69002cb4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Yu, K, Long, C, P, D & Chakraborty, T 2023, 'On efficient large maximal biplex discovery', IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 1, pp. 824-829. https://doi.org/10.1109/TKDE.2021.3077071","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8361447635","display_name":null,"funder_award_id":"M4082302","funder_id":"https://openalex.org/F4320320766","funder_display_name":"Nanyang Technological University"},{"id":"https://openalex.org/G8779162936","display_name":null,"funder_award_id":"SPARC programme project P620","funder_id":"https://openalex.org/F4320322724","funder_display_name":"Ministry of Education, India"}],"funders":[{"id":"https://openalex.org/F4320320766","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1503428008","https://openalex.org/W1974939910","https://openalex.org/W1984253569","https://openalex.org/W2036512590","https://openalex.org/W2074310030","https://openalex.org/W2078103658","https://openalex.org/W2117311203","https://openalex.org/W2119731214","https://openalex.org/W2164197909","https://openalex.org/W2607359632","https://openalex.org/W2809323004","https://openalex.org/W2911528866","https://openalex.org/W2966360566","https://openalex.org/W2990412241","https://openalex.org/W3029150735","https://openalex.org/W4255061622","https://openalex.org/W6684175947"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W57712237","https://openalex.org/W2578985712","https://openalex.org/W4300125793","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W2365968282","https://openalex.org/W2023774365"],"abstract_inverted_index":{"Cohesive":[0],"subgraph":[1],"discovery":[2],"is":[3,30,50],"an":[4,109],"important":[5],"problem":[6,48],"in":[7],"bipartite":[8],"graph":[9],"mining.":[10],"In":[11],"this":[12],"paper,":[13],"we":[14,73,107],"focus":[15],"on":[16,99,123],"one":[17,28],"kind":[18],"of":[19,27,37,60,131],"cohesive":[20],"structure,":[21],"called":[22],"k-biplex,":[23],"where":[24],"each":[25,63],"vertex":[26],"side":[29,64],"disconnected":[31],"from":[32,91],"at":[33,62,65],"most":[34],"k":[35],"vertices":[36,61],"the":[38,43,58,129],"other":[39],"side.":[40],"We":[41],"consider":[42],"large":[44],"maximal":[45,55],"k-biplex":[46],"enumeration":[47],"which":[49],"to":[51,80],"list":[52],"all":[53],"those":[54],"k-biplexes":[56],"with":[57,113],"number":[59],"least":[66],"a":[67],"non-negative":[68],"integer":[69],".":[70],"This":[71],"formulation,":[72],"observe,":[74],"has":[75],"various":[76],"applications":[77],"and":[78,95,101,117,125],"targets":[79],"find":[81],"non-redundant":[82],"results":[83,122],"by":[84],"excluding":[85],"non-maximal":[86],"ones.":[87],"Existing":[88],"approaches":[89],"suffer":[90],"massive":[92],"redundant":[93],"computations":[94],"can":[96],"only":[97],"run":[98],"small":[100],"moderate":[102],"datasets.":[103],"Towards":[104],"improving":[105],"scalability,":[106],"propose":[108],"efficient":[110],"tree-based":[111],"algorithm":[112,133],"two":[114],"advanced":[115],"strategies":[116],"powerful":[118],"pruning":[119],"techniques.":[120],"Experimental":[121],"real":[124],"synthetic":[126],"datasets":[127],"show":[128],"superiority":[130],"our":[132],"over":[134],"existing":[135],"approaches.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}