{"id":"https://openalex.org/W7143540071","doi":"https://doi.org/10.48550/arxiv.2603.26538","title":"Finding Minimal Clusters in st-DAGs","display_name":"Finding Minimal Clusters in st-DAGs","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7143540071","doi":"https://doi.org/10.48550/arxiv.2603.26538"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26538","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26538","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26538","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105407843","display_name":"Ulrich Vogl","orcid":"https://orcid.org/0000-0003-2399-2797"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vogl, Ulrich","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048017742","display_name":"Markus Siegle","orcid":"https://orcid.org/0000-0001-7639-2280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siegle, Markus","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105407843"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.226500004529953,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.226500004529953,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.11749999970197678,"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/T11106","display_name":"Data Management and Algorithms","score":0.09870000183582306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7059000134468079},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.5516999959945679},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5162000060081482},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4878000020980835},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4090000092983246},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.40049999952316284},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.36480000615119934},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3617999851703644}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7059000134468079},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6158000230789185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5558000206947327},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.5516999959945679},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5162000060081482},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4878000020980835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46470001339912415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4325999915599823},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294999897480011},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28450000286102295},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C2780129039","wikidata":"https://www.wikidata.org/wiki/Q1931107","display_name":"Section (typography)","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26538","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26538","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26538","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26538","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"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":{"Directed":[0],"Acylic":[1],"Graphs":[2],"with":[3,201],"a":[4,9,55,68,91,97,101,106,165,196],"single":[5,10],"entry":[6,75],"vertex":[7,12],"and":[8,77,99,185,213],"exit":[11,80],"(st-DAGs)":[13],"have":[14],"many":[15],"applications.":[16],"For":[17],"instance,":[18],"they":[19],"are":[20,65,113],"frequently":[21],"used":[22],"for":[23,40,100,130],"modelling":[24],"flow":[25],"problems":[26],"or":[27],"precedence":[28,117],"conditions":[29],"among":[30,119],"tasks,":[31],"work":[32],"packages,":[33],"etc..":[34],"This":[35],"paper":[36,163],"presents":[37],"an":[38],"algorithm":[39,128,142,212],"finding":[41,127],"special":[42],"types":[43],"of":[44,54,70,89,93,135,140,169,182,190,210],"subgraphs":[45],"in":[46,179,187],"such":[47],"st-DAGs,":[48],"called":[49,109],"clusters.":[50],"Knowing":[51],"the":[52,87,116,141,145,151,159,170,180,188,207,211],"clusters":[53,131],"given":[56,102,114],"st-DAG":[57,103],"is":[58,154,194],"very":[59],"useful":[60],"during":[61],"DAG":[62,183],"analysis.":[63],"Clusters":[64],"characterized":[66],"by":[67,115],"kind":[69],"synchronizing":[71],"behaviour":[72],"at":[73,78],"their":[74,79],"border":[76],"border.":[81],"In":[82],"this":[83],"context,":[84],"we":[85,104],"introduce":[86],"notion":[88],"syncpoint,":[90],"type":[92],"synchronisation":[94],"point":[95],"within":[96],"DAG,":[98,108],"construct":[105],"second":[107],"MSP-DAG,":[110,152],"whose":[111],"edges":[112],"relation":[118],"maximum":[120],"size":[121],"syncpoints":[122],"(MSPs).":[123],"Our":[124],"new":[125],"cluster":[126],"searches":[129],"between":[132],"potential":[133],"pairs":[134],"enclosing":[136],"MSPs.":[137],"The":[138,162],"efficiency":[139],"stems":[143],"from":[144],"fact":[146],"that":[147],"it":[148],"works":[149],"on":[150,199],"which":[153,173,205],"usually":[155],"much":[156],"smaller":[157],"than":[158],"original":[160],"st-DAG.":[161],"includes":[164],"thorough":[166],"complexity":[167],"analysis":[168],"algorithm's":[171],"runtime,":[172],"turns":[174],"out":[175],"to":[176],"be":[177],"quadratic":[178],"number":[181,189],"vertices":[184],"exponential":[186],"MSP-DAG":[191],"vertices.":[192],"There":[193],"also":[195],"section":[197],"reporting":[198],"experiments":[200],"randomly":[202],"generated":[203],"DAGs,":[204],"shows":[206],"practical":[208],"applicability":[209],"confirm":[214],"our":[215],"theoretical":[216],"findings.":[217]},"counts_by_year":[],"updated_date":"2026-03-31T06:07:48.031334","created_date":"2026-03-31T00:00:00"}