{"id":"https://openalex.org/W2030723170","doi":"https://doi.org/10.1109/dft.2014.6962102","title":"Shortest path reduction in a class of uniform fault tolerant networks","display_name":"Shortest path reduction in a class of uniform fault tolerant networks","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2030723170","doi":"https://doi.org/10.1109/dft.2014.6962102","mag":"2030723170"},"language":"en","primary_location":{"id":"doi:10.1109/dft.2014.6962102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft.2014.6962102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","raw_type":"proceedings-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/A5018353269","display_name":"Prashant D. Joshi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Prashant D. Joshi","raw_affiliation_strings":["Austin, Texas"],"affiliations":[{"raw_affiliation_string":"Austin, Texas","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005739146","display_name":"Said Hamdioui","orcid":"https://orcid.org/0000-0002-8961-0387"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Said Hamdioui","raw_affiliation_strings":["Delft University of Technology, Delft, The Netherlands","Delft Univ. of Tech., Delft, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft Univ. of Tech., Delft, The Netherlands#TAB#","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018353269"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12037569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"234","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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":0.9998999834060669,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7921488285064697},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7578505277633667},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6983310580253601},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6165452003479004},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6027016043663025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5774616003036499},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5619415044784546},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.559900164604187},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5034965872764587},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4850141704082489},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47732052206993103},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4323159158229828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39824098348617554},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37463271617889404},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.336323618888855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2850029766559601},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2839938998222351},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.24264422059059143},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1872551441192627},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11718454957008362},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11421528458595276},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10797902941703796}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7921488285064697},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7578505277633667},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6983310580253601},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6165452003479004},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6027016043663025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5774616003036499},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5619415044784546},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.559900164604187},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5034965872764587},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4850141704082489},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47732052206993103},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4323159158229828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39824098348617554},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37463271617889404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336323618888855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2850029766559601},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2839938998222351},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.24264422059059143},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1872551441192627},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11718454957008362},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11421528458595276},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10797902941703796},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dft.2014.6962102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft.2014.6962102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1729503770","https://openalex.org/W1829285233","https://openalex.org/W1876506647","https://openalex.org/W1971937118","https://openalex.org/W1974540633","https://openalex.org/W1975203667","https://openalex.org/W1981159511","https://openalex.org/W1998050844","https://openalex.org/W2016158083","https://openalex.org/W2055402279","https://openalex.org/W2085406987","https://openalex.org/W2105447142","https://openalex.org/W2107096560","https://openalex.org/W2107527903","https://openalex.org/W2112819731","https://openalex.org/W2113113620","https://openalex.org/W2124130287","https://openalex.org/W2125732536","https://openalex.org/W2128090945","https://openalex.org/W2132877272","https://openalex.org/W2136747096","https://openalex.org/W2145344665","https://openalex.org/W2155061423","https://openalex.org/W2168509479","https://openalex.org/W6639276891","https://openalex.org/W6679424116"],"related_works":["https://openalex.org/W2388051136","https://openalex.org/W2156431668","https://openalex.org/W2357391150","https://openalex.org/W2018146256","https://openalex.org/W2144050074","https://openalex.org/W2300956438","https://openalex.org/W2161960576","https://openalex.org/W2347245430","https://openalex.org/W2009448154","https://openalex.org/W2388893052"],"abstract_inverted_index":{"Shortest":[0],"path":[1],"determination":[2],"in":[3,29,37],"a":[4],"class":[5],"of":[6,40,49,60],"optimally":[7],"fault":[8],"tolerant":[9],"networks":[10],"designed":[11],"using":[12],"modified":[13],"line":[14],"graphs":[15],"is":[16,34,52],"described":[17],"here.":[18],"Appropriate":[19],"node":[20,41],"naming":[21],"allows":[22],"the":[23,38,50,55],"shortest":[24],"paths":[25],"to":[26],"be":[27],"determined":[28],"0(log":[30],"n)":[31],"steps.":[32],"This":[33],"applicable":[35],"even":[36],"presence":[39],"failures,":[42],"without":[43],"loops":[44],"or":[45],"backtracking.":[46],"The":[47],"stretch":[48],"network":[51],"maintained":[53],"at":[54],"theoretically":[56],"minimum":[57],"value":[58],"possible":[59],"one.":[61]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}