{"id":"https://openalex.org/W4415593687","doi":"https://doi.org/10.1109/tkde.2025.3625544","title":"Detecting Structural Balanced Near-Cliques in Large Signed Graphs","display_name":"Detecting Structural Balanced Near-Cliques in Large Signed Graphs","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W4415593687","doi":"https://doi.org/10.1109/tkde.2025.3625544"},"language":null,"primary_location":{"id":"doi:10.1109/tkde.2025.3625544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2025.3625544","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":null,"display_name":"Kai Yao","orcid":"https://orcid.org/0000-0002-2570-2741"},"institutions":[{"id":"https://openalex.org/I63354593","display_name":"Sichuan Normal University","ror":"https://ror.org/043dxc061","country_code":"CN","type":"education","lineage":["https://openalex.org/I63354593"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Yao","raw_affiliation_strings":["School of Computer Science, Sichuan Normal University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-2570-2741","affiliations":[{"raw_affiliation_string":"School of Computer Science, Sichuan Normal University, Chengdu, China","institution_ids":["https://openalex.org/I63354593"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Xinchen Zhang","orcid":"https://orcid.org/0009-0003-4717-071X"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xinchen Zhang","raw_affiliation_strings":["School of Computer Science, University of Sydney, Sydney, NSW, Australia","School of Computer Science, The University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0009-0003-4717-071X","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["School of Computer Science, University of Sydney, Sydney, NSW, Australia","School of Computer Science, The University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6830-3900","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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.29923864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1","first_page":"193","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7583000063896179,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.7583000063896179,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6450999975204468,"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/clique","display_name":"Clique","score":0.6489999890327454},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5788999795913696},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4611000120639801},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41029998660087585},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39399999380111694},{"id":"https://openalex.org/keywords/rigidity","display_name":"Rigidity (electromagnetism)","score":0.36410000920295715},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3628999888896942}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.679099977016449},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6489999890327454},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5788999795913696},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4611000120639801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4471000134944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4165000021457672},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C160343418","wikidata":"https://www.wikidata.org/wiki/Q185256","display_name":"Rigidity (electromagnetism)","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.36090001463890076},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C509619924","wikidata":"https://www.wikidata.org/wiki/Q17130757","display_name":"Structural complexity","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29159998893737793},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.2858999967575073},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26899999380111694},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2025.3625544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2025.3625544","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3323630674","display_name":"Directionality-Aware Cohesive Subgraph Search over Directed Graphs","funder_award_id":"DP220103731","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G3700126081","display_name":null,"funder_award_id":"2025ZNSFSC1468","funder_id":"https://openalex.org/F4320329861","funder_display_name":"Natural Science Foundation of Sichuan Province"}],"funders":[{"id":"https://openalex.org/F4320329861","display_name":"Natural Science Foundation of Sichuan Province","ror":null},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1485742133","https://openalex.org/W1539662764","https://openalex.org/W1974939910","https://openalex.org/W1978544932","https://openalex.org/W1980769375","https://openalex.org/W2001966531","https://openalex.org/W2002582122","https://openalex.org/W2004147977","https://openalex.org/W2017109153","https://openalex.org/W2023536175","https://openalex.org/W2053081145","https://openalex.org/W2110582765","https://openalex.org/W2112935688","https://openalex.org/W2115826669","https://openalex.org/W2116007667","https://openalex.org/W2160429376","https://openalex.org/W2364972310","https://openalex.org/W2603973660","https://openalex.org/W2605255209","https://openalex.org/W2742477721","https://openalex.org/W2752109642","https://openalex.org/W2794823917","https://openalex.org/W2804000423","https://openalex.org/W2809323004","https://openalex.org/W2964140784","https://openalex.org/W2984323893","https://openalex.org/W2998215451","https://openalex.org/W3003054384","https://openalex.org/W3012776243","https://openalex.org/W3012937529","https://openalex.org/W3142588439","https://openalex.org/W4224316423","https://openalex.org/W4225137014","https://openalex.org/W4230158058","https://openalex.org/W4289599811","https://openalex.org/W4298299405","https://openalex.org/W4313065576","https://openalex.org/W4328055024","https://openalex.org/W4367310488","https://openalex.org/W4368232805","https://openalex.org/W4384521523","https://openalex.org/W4400909546","https://openalex.org/W4401857434","https://openalex.org/W4408519533"],"related_works":[],"abstract_inverted_index":{"Signed":[0],"graphs,":[1,31],"with":[2,54],"friendly":[3],"(positive)":[4],"and":[5,45,57,84,170,238,247],"antagonistic":[6],"(negative)":[7],"edges,":[8],"capture":[9],"important":[10],"structural":[11,17,37,75,87,109],"properties":[12],"of":[13,95,143,166,210,244,250],"real-world":[14,237],"phenomena.":[15],"The":[16],"balanced":[18,38,76,110],"clique":[19,39,44],"model":[20],"has":[21],"recently":[22],"been":[23],"formulated":[24],"to":[25,99,140,153,204,212],"identify":[26],"polarized":[27],"structures":[28],"in":[29,68],"signed":[30],"where":[32,220],"a":[33,36,43,80,101,121,159,175,227],"graph":[34],"is":[35,42,112,137,226],"if":[40],"it":[41],"its":[46,66],"vertices":[47],"can":[48],"be":[49],"divided":[50],"into":[51],"two":[52],"sets":[53],"positive":[55],"intra-set":[56],"negative":[58],"cross-set":[59],"edges.":[60],"However,":[61,134],"this":[62,71,116,155],"model's":[63],"rigidity":[64],"restricts":[65],"applicability":[67],"practice.":[69],"In":[70],"paper,":[72],"we":[73,91,118,198],"consider":[74],"near-cliques":[77],"by":[78,125,157],"allowing":[79],"few":[81],"missing":[82],"connections":[83],"deviations":[85],"from":[86,129],"balance":[88],"theory.":[89],"Specifically,":[90],"adopt":[92,199],"the":[93,130,141,150,163,167,200,206,242,248],"definition":[94],"<italic":[96,182,190],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[97,183,185,187,191,193,195,214,216,218,222],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</i>-plex":[98],"represent":[100],"near-clique.":[102],"We":[103,147],"prove":[104,171],"that":[105,172,229],"enumerating":[106],"all":[107],"maximal":[108],"k-plexes":[111],"#P-hard.":[113],"To":[114],"solve":[115],"problem,":[117],"first":[119],"propose":[120,149],"backtracking":[122],"algorithm":[123,151],"MBPE-BK,":[124],"drawing":[126],"inspi":[127],"ration":[128],"well-known":[131],"Bron-Kerbosch":[132],"algorithm.":[133],"MBPE-BK's":[135],"performance":[136],"unsatisfactory":[138],"due":[139],"issue":[142,156],"overlapping":[144],"candidate":[145],"sets.":[146],"then":[148],"MBPE":[152,173,211],"overcome":[154],"adopting":[158],"different":[160],"strategy":[161,203],"at":[162],"root":[164],"level":[165],"search":[168],"tree,":[169],"achieves":[174],"better":[176],"time":[177,208],"complexity":[178,209],"than":[179],"MBPE-BK":[180],"(i.e.,":[181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i><sup":[184,192],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2217</sup>(2<sup":[186],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b4</sup>)":[188],"v.s.":[189],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2217</sup>(3<sup":[194],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b4D</sup>)).":[196],"Finally,":[197],"minimum-degree":[201],"branching":[202],"improve":[205],"worst-case":[207],"O<sup":[213],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2217</sup>(\u03b1<sup":[215],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b4</sup><sub":[217],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sub>),":[219],"\u03b1<sub":[221],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sub>":[223],"<":[224],"2":[225],"constant":[228],"depends":[230],"only":[231],"on":[232,236],"k.":[233],"Extensive":[234],"experiments":[235],"synthetic":[239],"datasets":[240],"demonstrate":[241],"efficiency":[243],"our":[245,251],"algorithms":[246],"effectiveness":[249],"model.":[252]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-28T00:00:00"}