{"id":"https://openalex.org/W4288723498","doi":"https://doi.org/10.48550/arxiv.2207.13638","title":"A Simple and Elegant Mathematical Formulation for the Acyclic DAG Partitioning Problem","display_name":"A Simple and Elegant Mathematical Formulation for the Acyclic DAG Partitioning Problem","publication_year":2022,"publication_date":"2022-07-27","ids":{"openalex":"https://openalex.org/W4288723498","doi":"https://doi.org/10.48550/arxiv.2207.13638"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2207.13638","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.13638","pdf_url":"https://arxiv.org/pdf/2207.13638","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2207.13638","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085400686","display_name":"M. Yusuf \u00d6zkaya","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"\u00d6zkaya, M. Yusuf","raw_affiliation_strings":["Georgia Institute of Technology School of Computational Science and Engineering https :// myozka "],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology School of Computational Science and Engineering https :// myozka ","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026046737","display_name":"\u00dcmit V. \u00c7ataly\u00fcrek","orcid":"https://orcid.org/0000-0002-5625-3758","observed_orcids":["https://orcid.org/0000-0002-5625-3758"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"\u00c7ataly\u00fcrek, \u00dcmit V.","raw_affiliation_strings":["Georgia Institute of Technology School of Computational Science and Engineering and Amazon Web Services"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology School of Computational Science and Engineering and Amazon Web Services","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":6,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8403000235557556,"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.8403000235557556,"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.04910000041127205,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.03660000115633011,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9440000057220459},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6759999990463257},{"id":"https://openalex.org/keywords/mathematical-formulation","display_name":"mathematical formulation","score":0.675000011920929},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.7390000224113464},{"id":"https://openalex.org/keywords/quotient-graphs","display_name":"quotient graphs","score":0.925000011920929},{"id":"https://openalex.org/keywords/vlsi-design","display_name":"VLSI design","score":0.7559999823570251},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.800000011920929},{"id":"https://openalex.org/keywords/rtl-simulation","display_name":"RTL simulation","score":0.9850000143051147}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.945820689201355},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.7180237770080566},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5813040137290955},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.5688499808311462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5543844699859619},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5431948304176331},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.43916451930999756},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.41284266114234924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41042831540107727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3510129451751709},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3311837315559387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3252982497215271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27993708848953247},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.24508395791053772},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.172536700963974}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2207.13638","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.13638","pdf_url":"https://arxiv.org/pdf/2207.13638","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2207.13638","doi":"https://doi.org/10.48550/arxiv.2207.13638","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2207.13638","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2207.13638","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.13638","pdf_url":"https://arxiv.org/pdf/2207.13638","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4288723498.pdf","grobid_xml":"https://content.openalex.org/works/W4288723498.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2065309575","https://openalex.org/W2135114615","https://openalex.org/W2883867401","https://openalex.org/W2954427512","https://openalex.org/W3011895995","https://openalex.org/W4312243397"],"related_works":["https://openalex.org/W83339318","https://openalex.org/W2138233678","https://openalex.org/W4406449436","https://openalex.org/W2954427512","https://openalex.org/W2728444714","https://openalex.org/W78658037","https://openalex.org/W4405941862","https://openalex.org/W4235342372","https://openalex.org/W2078959432","https://openalex.org/W2804339795"],"abstract_inverted_index":{"This":[0],"work":[1],"addresses":[2],"the":[3,22,45,49,61,65,77,81,91,120,165,175,189],"NP-Hard":[4],"problem":[5,17,179],"of":[6,25,48,64,102,146,159],"acyclic":[7,9,15,29,116,160,176],"directed":[8,28,115],"graph":[10,30,83,122,127],"(DAG)":[11],"partitioning":[12,16,21,178],"problem.":[13,190],"The":[14],"is":[18,74,112,124],"defined":[19],"as":[20,138],"vertex":[23,50],"set":[24],"a":[26,56,97,114,126,168],"given":[27],"into":[31],"disjoint":[32],"and":[33,60,100,134,150,170,186],"collectively":[34],"exhaustive":[35],"subsets":[36],"(parts).":[37],"Parts":[38],"are":[39,88,94,104],"to":[40,90,96],"be":[41],"assigned":[42,89],"such":[43,137],"that":[44,68,87,128,180],"total":[46,62],"sum":[47,63],"weights":[51],"within":[52],"each":[53],"part":[54,93],"satisfies":[55],"common":[57],"upper":[58],"bound":[59],"edge":[66],"costs":[67],"connect":[69],"nodes":[70,86],"across":[71],"different":[72],"parts":[73],"minimized.":[75],"Additionally,":[76],"quotient":[78,121],"graph,":[79],"i.e.,":[80],"induced":[82],"where":[84],"all":[85],"same":[92],"contracted":[95],"single":[98],"node":[99],"edges":[101,108],"those":[103],"replaced":[105],"with":[106],"cumulative":[107],"towards":[109],"other":[110],"nodes,":[111],"also":[113,125],"graph.":[117],"That":[118],"is,":[119],"itself":[123],"contains":[129],"no":[130],"cycles.":[131],"Many":[132],"computational":[133,140],"real-life":[135],"applications":[136],"in":[139],"task":[141],"scheduling,":[142],"RTL":[143],"simulations,":[144],"scheduling":[145],"rail-rail":[147],"transshipment":[148],"tasks":[149],"Very":[151],"Large":[152],"Scale":[153],"Integration":[154],"(VLSI)":[155],"design":[156],"make":[157],"use":[158],"DAG":[161,177],"partitioning.":[162],"We":[163],"address":[164],"need":[166],"for":[167,174],"simple":[169],"elegant":[171],"mathematical":[172],"formulation":[173],"enables":[181],"easier":[182],"understanding,":[183],"communication,":[184],"implementation,":[185],"experimentation":[187],"on":[188]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-07-30T00:00:00"}