{"id":"https://openalex.org/W1966252990","doi":"https://doi.org/10.1016/s0020-0190(00)00022-3","title":"Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms","display_name":"Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W1966252990","doi":"https://doi.org/10.1016/s0020-0190(00)00022-3","mag":"1966252990"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(00)00022-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(00)00022-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["Department of Computer Science, Comenius University, Bratislava, Slovakia","Dept. of Computer Science, Comenius University, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]},{"raw_affiliation_string":"Dept. of Computer Science, Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088287514"],"corresponding_institution_ids":["https://openalex.org/I74788687"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1626873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"73","issue":"5-6","first_page":"221","last_page":"225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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.9944999814033508,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.991599977016449,"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/computer-science","display_name":"Computer science","score":0.6380099654197693},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.628928542137146},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6147972345352173},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5876570343971252},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5334394574165344},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5321679711341858},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.47336503863334656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4724205732345581},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4418407082557678},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4331378638744354},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.37192267179489136},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34964311122894287},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3258485496044159},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28681764006614685},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.26539790630340576},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17656895518302917},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14550122618675232}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6380099654197693},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.628928542137146},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6147972345352173},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5876570343971252},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5334394574165344},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5321679711341858},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.47336503863334656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4724205732345581},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4418407082557678},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4331378638744354},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.37192267179489136},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34964311122894287},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3258485496044159},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28681764006614685},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26539790630340576},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17656895518302917},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14550122618675232}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0020-0190(00)00022-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(00)00022-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.4036","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rochester.edu/~stefanko/Publications/IPL - acyclic.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W105412555","https://openalex.org/W1876999181","https://openalex.org/W1967291945","https://openalex.org/W1989693809","https://openalex.org/W2041552823","https://openalex.org/W2055355743","https://openalex.org/W2109053145","https://openalex.org/W2134376893","https://openalex.org/W2154323564","https://openalex.org/W2164501624","https://openalex.org/W2164687688","https://openalex.org/W6639285691","https://openalex.org/W6641292302","https://openalex.org/W6642062153","https://openalex.org/W6679777721"],"related_works":["https://openalex.org/W2916710807","https://openalex.org/W4286907761","https://openalex.org/W2413588304","https://openalex.org/W3205447645","https://openalex.org/W2009411567","https://openalex.org/W2774705104","https://openalex.org/W2371629703","https://openalex.org/W2097769911","https://openalex.org/W72835634","https://openalex.org/W1998712144"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}