{"id":"https://openalex.org/W7131273745","doi":"https://doi.org/10.71448/bcds2343-3","title":"Breaking the 2n Barrier for Directed Node Multiway Cut via Terminal-Torso Decomposition","display_name":"Breaking the 2n Barrier for Directed Node Multiway Cut via Terminal-Torso Decomposition","publication_year":2023,"publication_date":"2023-12-30","ids":{"openalex":"https://openalex.org/W7131273745","doi":"https://doi.org/10.71448/bcds2343-3"},"language":null,"primary_location":{"id":"doi:10.71448/bcds2343-3","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2343-3","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.71448/bcds2343-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104198496","display_name":"Abdulbasit Alazzawi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abdulbasit ALazzawi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126738405","display_name":"Bahbibi Rahmatullah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bahbibi Rahmatullah","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126728764","display_name":"Universiti Pendidikan Sultan Idris, Tanjung Malim, Perak, Malaysia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Universiti Pendidikan Sultan Idris, Tanjung Malim, Perak, Malaysia","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5104198496"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4794488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3","first_page":"23","last_page":"35"},"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.5795999765396118,"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.5795999765396118,"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.13979999721050262,"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/T12029","display_name":"DNA and Biological Computing","score":0.13199999928474426,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.781000018119812},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6757000088691711},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5371000170707703},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5235999822616577},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4909999966621399},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4902999997138977},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4788999855518341},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47290000319480896},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47200000286102295},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.4652999937534332}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.781000018119812},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6757000088691711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6420000195503235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5874999761581421},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5371000170707703},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5235999822616577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4950000047683716},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4909999966621399},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4902999997138977},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4788999855518341},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47200000286102295},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4472000002861023},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.435699999332428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4113999903202057},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.38499999046325684},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C523889960","wikidata":"https://www.wikidata.org/wiki/Q160695","display_name":"Torso","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.31130000948905945},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.28380000591278076},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C94020503","wikidata":"https://www.wikidata.org/wiki/Q12916","display_name":"Real number","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.71448/bcds2343-3","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2343-3","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.71448/bcds2343-3","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2343-3","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,136],"study":[1],"the":[2,95,105,154,164,177,218,244,247,273,294,299,310,313],"Directed":[3],"Node":[4],"Multiway":[5],"Cut":[6],"(DNMWC)":[7],"problem:":[8],"given":[9],"a":[10,17,61,68,89,167,172,181,206,228,258,268,321],"directed":[11,54,96,182,222,283,314],"graph":[12,300],"D":[13],"=":[14],"(V,":[15],"A),":[16],"terminal":[18,210,239],"set":[19],"T":[20,48,50],"\u2286":[21],"V":[22],"(terminals":[23],"are":[24,196,318],"undeletable),":[25],"and":[26,119,148,226,251,292],"an":[27,102,138,214],"integer":[28],"k,":[29],"delete":[30],"at":[31,112,290],"most":[32],"k":[33],"non-terminal":[34],"vertices":[35,188,235],"so":[36],"that":[37,67,128,189,232,282,293],"for":[38,88,142,276],"every":[39],"ordered":[40],"pair":[41],"of":[42,63,91,158,209,220,298],"distinct":[43],"terminals":[44,115,307],"(s,":[45],"t)":[46],"\u2208":[47],"\u00d7":[49],"there":[51],"is":[52,200,249,286],"no":[53],"path":[55],"from":[56],"s":[57],"to":[58,80,109,312],"t.":[59],"While":[60],"line":[62],"work":[64],"has":[65,100],"shown":[66],"simple":[69],"\u201cguess":[70],"outside":[71],"T,":[72,170],"torso":[73,168,248],"on":[74,169,217,246],"T\u201d":[75],"strategy":[76],"can":[77,131,254,301],"be":[78,117,134,255,302],"used":[79],"obtain":[81],"exact":[82],"algorithms":[83],"with":[84],"running":[85,144],"time":[86,146],"O*(cn)":[87],"range":[90],"undirected":[92],"terminal-set":[93,277],"problems,":[94],"node":[97],"multiway":[98,284],"cut":[99],"remained":[101],"explicit":[103],"obstacle:":[104],"same":[106,295],"framework":[107,275],"appears":[108],"top":[110],"out":[111],"O*(2n)":[113],"once":[114,316],"cannot":[116],"deleted":[118],"reachability":[120,194,211],"becomes":[121],"asymmetric.":[122],"In":[123],"this":[124,129],"paper":[125],"we":[126],"show":[127],"barrier":[130],"in":[132,145,185,191,309,320],"fact":[133],"broken.":[135],"present":[137],"exact,":[139],"deterministic":[140],"algorithm":[141],"DNMWC":[143],"O*(1.999n)":[147],"polynomial":[149],"space.":[150],"Our":[151,265],"approach":[152],"keeps":[153],"overall":[155],"three-phase":[156],"recipe":[157],"Chitnis":[159],"et":[160],"al.":[161],"[1]":[162],"(guess":[163],"non-terminals,":[165],"build":[166],"solve":[171],"smaller":[173],"subproblem)":[174],"but":[175],"replaces":[176],"naive":[178],"guessing":[179],"by":[180,203,236,257,272],"separator":[183],"enumeration":[184],"which":[186],"only":[187,306],"participate":[190],"many":[192,238],"terminal-to-terminal":[193],"patterns":[195],"ever":[197],"guessed.":[198],"This":[199],"made":[201],"possible":[202],"combining:":[204],"(i)":[205],"canonical":[207],"choice":[208],"profiles,":[212],"(ii)":[213],"upper":[215],"bound":[216],"number":[219],"important":[221],"separators":[223,317],"per":[224],"profile,":[225],"(iii)":[227],"refined":[229],"measure-and-conquer":[230],"analysis":[231],"weights":[233],"guessed":[234,303],"how":[237],"pairs":[240],"they":[241],"separate.":[242],"Since":[243],"subproblem":[245],"small":[250],"structured,":[252],"it":[253,280],"solved":[256],"direct":[259],"exponential-time":[260],"dynamic":[261],"program":[262],"over":[263],"T.":[264],"result":[266],"answers":[267],"question":[269],"left":[270],"open":[271],"torso-based":[274],"vertex":[278],"deletion:":[279],"shows":[281],"separation":[285],"not":[287],"inherently":[288],"stuck":[289],"2n,":[291],"structural":[296],"insight\u2014\u201cmost":[297],"away":[304],"because":[305],"matter":[308],"end\u201d\u2014extends":[311],"setting":[315],"enumerated":[319],"reachability-aware":[322],"way.":[323]},"counts_by_year":[],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2026-02-25T00:00:00"}