{"id":"https://openalex.org/W7126101570","doi":"https://doi.org/10.1109/comcomap68359.2025.11353181","title":"Heuristic-Guided Iterative Compression for Efficient Graph Bipartization","display_name":"Heuristic-Guided Iterative Compression for Efficient Graph Bipartization","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7126101570","doi":"https://doi.org/10.1109/comcomap68359.2025.11353181"},"language":null,"primary_location":{"id":"doi:10.1109/comcomap68359.2025.11353181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comcomap68359.2025.11353181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Computing, Communications and IoT Applications (ComComAp)","raw_type":"proceedings-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/A5011587830","display_name":"Mahsa Sadeghi","orcid":"https://orcid.org/0000-0002-2159-7518"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mahsa Sadeghi","raw_affiliation_strings":["University of Winnipeg,Applied Computer Science,Winnipeg,Canada"],"affiliations":[{"raw_affiliation_string":"University of Winnipeg,Applied Computer Science,Winnipeg,Canada","institution_ids":["https://openalex.org/I872945872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101996550","display_name":"Yibin Chen","orcid":"https://orcid.org/0009-0004-0587-0379"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yangjun Chen","raw_affiliation_strings":["University of Winnipeg,Applied Computer Science,Winnipeg,Canada"],"affiliations":[{"raw_affiliation_string":"University of Winnipeg,Applied Computer Science,Winnipeg,Canada","institution_ids":["https://openalex.org/I872945872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011587830"],"corresponding_institution_ids":["https://openalex.org/I872945872"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78573475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"64","last_page":"70"},"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.3303000032901764,"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.3303000032901764,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.27390000224113464,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0869000032544136,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5042999982833862},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.478300005197525},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47099998593330383},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43869999051094055},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.38089999556541443},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.364300012588501},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.3605000078678131}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6488000154495239},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5102999806404114},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5042999982833862},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4830000102519989},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.478300005197525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43869999051094055},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.3605000078678131},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34630000591278076},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comcomap68359.2025.11353181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comcomap68359.2025.11353181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Computing, Communications and IoT Applications (ComComAp)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2051856222","https://openalex.org/W2105680721","https://openalex.org/W2914414140","https://openalex.org/W2992705078","https://openalex.org/W3207086400"],"related_works":[],"abstract_inverted_index":{"The":[0,105],"Odd":[1],"Cycle":[2],"Transversal":[3],"(OCT)":[4],"problem,":[5],"also":[6,108],"known":[7],"as":[8,91],"Graph":[9],"Bipartization,":[10],"asks":[11],"whether":[12],"a":[13,33,80,141],"given":[14],"undirected":[15],"graph":[16,89,188],"can":[17],"be":[18],"made":[19],"bipartite":[20],"by":[21,68],"deleting":[22],"at":[23],"most":[24],"k":[25],"vertices.":[26],"Here,":[27],"an":[28],"odd":[29],"cycle":[30],"transversal":[31],"means":[32],"subset":[34],"of":[35,72,144,163],"nodes":[36],"with":[37],"each":[38],"appearing":[39],"on":[40,127],"one":[41,45],"or":[42],"more":[43],"than":[44],"cycle.":[46],"Although":[47],"iterative":[48,84],"compression":[49,85,154],"algorithms":[50],"are":[51,177],"widely":[52],"used":[53],"for":[54,166,179],"solving":[55,169],"OCT":[56,168],"within":[57],"fixed-parameter":[58],"tractable":[59],"(FPT)":[60],"bounds,":[61],"their":[62],"practical":[63],"performance":[64],"is":[65,156],"often":[66],"limited":[67],"the":[69,145,161],"exponential":[70],"number":[71],"subsets":[73,99],"explored":[74],"during":[75],"compression.":[76],"This":[77],"paper":[78],"introduces":[79],"heuristic-guided":[81],"enhancement":[82],"to":[83,114],"that":[86],"integrates":[87],"structural":[88],"measures\u2013such":[90],"degree,":[92],"betweenness,":[93],"and":[94,100,112,129,149,186],"closeness":[95],"centrality\u2013to":[96],"prioritize":[97],"promising":[98],"prune":[101],"infeasible":[102],"configurations":[103],"early.":[104],"proposed":[106],"method":[107],"reuses":[109],"partial":[110],"flows":[111],"colorings":[113],"reduce":[115],"redundant":[116],"computations.":[117],"Experimental":[118],"results":[119],"demonstrate":[120],"substantial":[121],"runtime":[122],"improvements,":[123],"achieving":[124],"2x\u22124x":[125],"speedups":[126],"synthetic":[128],"real-world":[130],"graphs":[131],"without":[132],"sacrificing":[133],"solution":[134],"quality.":[135],"Beyond":[136],"empirical":[137],"validation,":[138],"we":[139],"provide":[140],"formal":[142],"analysis":[143],"heuristic":[146],"search":[147],"space":[148],"discuss":[150],"conditions":[151],"under":[152],"which":[153],"complexity":[155],"reduced.":[157],"These":[158],"findings":[159],"highlight":[160],"potential":[162],"structure-aware":[164],"optimizations":[165,176],"scalable":[167],"in":[170,181],"large":[171],"graphs.":[172],"In":[173],"particular,":[174],"such":[175],"relevant":[178],"applications":[180],"network":[182],"reliability,":[183],"communication":[184],"systems,":[185],"large-scale":[187],"analysis.":[189]},"counts_by_year":[],"updated_date":"2026-02-01T03:34:12.195049","created_date":"2026-01-30T00:00:00"}