{"id":"https://openalex.org/W7124163787","doi":"https://doi.org/10.1109/codit66093.2025.11321231","title":"Minimum Topological s\u2013t Cut Problems","display_name":"Minimum Topological s\u2013t Cut Problems","publication_year":2025,"publication_date":"2025-07-15","ids":{"openalex":"https://openalex.org/W7124163787","doi":"https://doi.org/10.1109/codit66093.2025.11321231"},"language":null,"primary_location":{"id":"doi:10.1109/codit66093.2025.11321231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321231","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5047879098","display_name":"Javad Tayyebi","orcid":"https://orcid.org/0000-0002-7559-3870"},"institutions":[{"id":"https://openalex.org/I97626857","display_name":"University of Birjand","ror":"https://ror.org/03g4hym73","country_code":"IR","type":"education","lineage":["https://openalex.org/I97626857"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Javad Tayyebi","raw_affiliation_strings":["Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Industrial Engineering,Birjand,Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Industrial Engineering,Birjand,Iran","institution_ids":["https://openalex.org/I97626857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079625019","display_name":"Adrian Marius Deaconu","orcid":"https://orcid.org/0000-0002-1070-1383"},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Adrian Marius Deaconu","raw_affiliation_strings":["Transilvania University of Brasov,Department of Mathematics and Computer Science,Brasov,Romania,500091"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Transilvania University of Brasov,Department of Mathematics and Computer Science,Brasov,Romania,500091","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077517114","display_name":"Malihe Niksirat","orcid":"https://orcid.org/0000-0003-4668-3145"},"institutions":[{"id":"https://openalex.org/I97626857","display_name":"University of Birjand","ror":"https://ror.org/03g4hym73","country_code":"IR","type":"education","lineage":["https://openalex.org/I97626857"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Malihe Niksirat","raw_affiliation_strings":["Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Computer Science,Birjand,Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Computer Science,Birjand,Iran","institution_ids":["https://openalex.org/I97626857"]}]}],"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.62393526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"811","last_page":"816"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.5206000208854675,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.5206000208854675,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.17080000042915344,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09539999812841415,"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/path","display_name":"Path (computing)","score":0.6406999826431274},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.6305000185966492},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5379999876022339},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.44130000472068787},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41769999265670776},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.39579999446868896},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.382999986410141},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.37439998984336853},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.36579999327659607}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6990000009536743},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6406999826431274},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.6305000185966492},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5379999876022339},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43619999289512634},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39739999175071716},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.382999986410141},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.3224000036716461},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3151000142097473},{"id":"https://openalex.org/C81332173","wikidata":"https://www.wikidata.org/wiki/Q179899","display_name":"Topological space","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C24977911","wikidata":"https://www.wikidata.org/wiki/Q1491995","display_name":"Connected space","level":3,"score":0.31360000371932983},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C2778478883","wikidata":"https://www.wikidata.org/wiki/Q7825025","display_name":"Topological complexity","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2612999975681305}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit66093.2025.11321231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321231","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1518039036","https://openalex.org/W1847903816","https://openalex.org/W1965800821","https://openalex.org/W1969523663","https://openalex.org/W1987197912","https://openalex.org/W2032846330","https://openalex.org/W2034509988","https://openalex.org/W2039086323","https://openalex.org/W2066737954","https://openalex.org/W2068595367","https://openalex.org/W2103099082","https://openalex.org/W2121204510","https://openalex.org/W2138560648","https://openalex.org/W2741786970","https://openalex.org/W2792834173","https://openalex.org/W3011053358","https://openalex.org/W3046564025","https://openalex.org/W4254419859","https://openalex.org/W4313001655","https://openalex.org/W4381884172"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,15,71],"novel":[4],"combinatorial":[5],"structure":[6],"known":[7],"as":[8],"the":[9,59,62],"topological":[10,29,79],"s":[11],"\u2212":[12],"t":[13],"cut,":[14],"specialized":[16],"type":[17],"of":[18,37],"s\u2212t":[19,27,30,39,80,83],"cut":[20],"applicable":[21],"to":[22,48,57],"acyclic":[23,85],"networks.":[24,69,86],"Unlike":[25],"traditional":[26],"cuts,":[28],"cuts":[31,81],"intersect":[32],"with":[33],"exactly":[34],"one":[35],"arc":[36],"any":[38],"path":[40],"d.":[41],"A":[42],"linear":[43],"programming":[44],"formulation":[45],"is":[46,54,74],"presented":[47],"tackle":[49],"this":[50],"problem":[51,60],"and":[52],"it":[53],"shown":[55],"how":[56],"solve":[58],"using":[61],"well-known":[63],"maximum":[64],"flow":[65],"algorithms":[66],"on":[67],"auxiliary":[68],"Additionally,":[70],"linear-time":[72],"method":[73],"developed":[75],"for":[76],"finding":[77],"minimum":[78],"in":[82],"planar":[84]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-15T00:00:00"}