{"id":"https://openalex.org/W2274172289","doi":"https://doi.org/10.1515/macro-2015-0006","title":"A Modified Inertial Method for Loop-free Decomposition of Acyclic Directed Graphs","display_name":"A Modified Inertial Method for Loop-free Decomposition of Acyclic Directed Graphs","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W2274172289","doi":"https://doi.org/10.1515/macro-2015-0006","mag":"2274172289"},"language":"en","primary_location":{"id":"doi:10.1515/macro-2015-0006","is_oa":false,"landing_page_url":"https://doi.org/10.1515/macro-2015-0006","pdf_url":null,"source":{"id":"https://openalex.org/S4210215974","display_name":"MACRo 2015","issn_l":"2247-0948","issn":["2247-0948"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MACRo 2015","raw_type":"journal-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/A5071491835","display_name":"D\u00e1niel Andr\u00e1s Drexler","orcid":"https://orcid.org/0000-0001-6655-4354"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel A. Drexler","raw_affiliation_strings":["Department of Control Engineering and Information Technology, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033477246","display_name":"P\u00e9ter Arat\u00f3","orcid":"https://orcid.org/0000-0003-2627-0511"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"P\u00e9ter Arat\u00f3","raw_affiliation_strings":["Department of Control Engineering and Information Technology, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":0.3978,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.44730679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"1","first_page":"61","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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/decomposition","display_name":"Decomposition","score":0.7383090257644653},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6606298685073853},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5802772641181946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.527337908744812},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4996016025543213},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.47523215413093567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.420979380607605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3678719699382782},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3493931293487549},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31200408935546875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31135714054107666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28160274028778076},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13602563738822937},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1146908700466156},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06750518083572388}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7383090257644653},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6606298685073853},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5802772641181946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.527337908744812},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4996016025543213},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.47523215413093567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.420979380607605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3678719699382782},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3493931293487549},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31200408935546875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31135714054107666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28160274028778076},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13602563738822937},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1146908700466156},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06750518083572388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1515/macro-2015-0006","is_oa":false,"landing_page_url":"https://doi.org/10.1515/macro-2015-0006","pdf_url":null,"source":{"id":"https://openalex.org/S4210215974","display_name":"MACRo 2015","issn_l":"2247-0948","issn":["2247-0948"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MACRo 2015","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1496467140","https://openalex.org/W1984843974","https://openalex.org/W2026000735","https://openalex.org/W2039824876","https://openalex.org/W2073890622","https://openalex.org/W2096159022","https://openalex.org/W2096205327","https://openalex.org/W2099092826","https://openalex.org/W2132935493","https://openalex.org/W2161455936"],"related_works":["https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W4302345037","https://openalex.org/W2952978498","https://openalex.org/W24774503","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W3191289342","https://openalex.org/W1996198939","https://openalex.org/W2372780902"],"abstract_inverted_index":{"Abstract":[0],"Graph":[1],"decomposition":[2,22,44,52,56],"is":[3,13,45],"a":[4,24,49],"key":[5],"process":[6],"in":[7,35,83],"system-level":[8],"synthesis,":[9],"even":[10],"if":[11],"it":[12],"used":[14],"for":[15,28,94],"allocation":[16],"(e.g.":[17,27],"hardware-software":[18],"partitioning)":[19],"or":[20],"simple":[21],"as":[23],"preprocessing":[25],"step":[26],"pipelining).":[29],"Acyclic":[30],"graphs":[31],"are":[32],"usually":[33],"desirable":[34],"the":[36,41,62,70,78,88],"design":[37],"processes,":[38],"thus":[39],"preserving":[40],"acyclicity":[42],"during":[43],"crucial.":[46],"We":[47,58],"propose":[48],"modified":[50],"inertial":[51],"to":[53,61],"create":[54],"loop-free":[55],"results.":[57],"assign":[59],"coordinates":[60],"nodes":[63],"based":[64],"on":[65],"their":[66],"maximal":[67],"distance":[68],"from":[69],"inputs,":[71],"and":[72,92],"give":[73],"an":[74],"algorithm":[75],"that":[76],"finds":[77],"required":[79],"number":[80,96],"of":[81,90,97],"cuts":[82],"polynomial":[84],"time":[85],"while":[86],"balancing":[87],"size":[89],"segments":[91],"looking":[93],"minimal":[95],"edges":[98],"along":[99],"cuts.":[100]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}