{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:08:59Z","timestamp":1730214539698,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/dft.2014.6962102","type":"proceedings-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T23:16:22Z","timestamp":1417475782000},"page":"234-239","source":"Crossref","is-referenced-by-count":0,"title":["Shortest path reduction in a class of uniform fault tolerant networks"],"prefix":"10.1109","author":[{"given":"Prashant D.","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Said","family":"Hamdioui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Reverse Line Graph Construction The Matrix Relabeling Algorithm MARMLINGA Versus Roussopoulos's Algorithm","year":"2010","author":"trajanovski","key":"19"},{"key":"17","article-title":"On digraphs with minimum diameter and maximum connectivity","author":"reddy","year":"1982","journal-title":"The Proceedings of the 20s1 Annual Allerton Confernce"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676513"},{"key":"15","first-page":"105","article-title":"Digraphs on alphabets and the (d.n) digraph problem","volume":"25","author":"fiol","year":"1988","journal-title":"Ars Combinatoria"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676455"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00333-4"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/800046.801653"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140106"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/12.67324"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90034-C"},{"key":"22","first-page":"1","article-title":"On the complexity of and algorithms for finding the shortest path with disjoint counterpart","volume":"14","author":"xu","year":"2006","journal-title":"IEEE\/ ACM Transactions on Networking"},{"key":"23","article-title":"Modified uniform line digraphs with optimal connectivity and small diameteres","author":"joshi","year":"2014","journal-title":"Forty-Fifth Southeastern International Conference on Combinatorics Graph Theory and Computing"},{"journal-title":"Algorithms for self-healing networks","year":"2010","author":"trehan","key":"24"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.49"},{"key":"26","article-title":"Self healing networks","author":"poor","year":"2003","journal-title":"ACM Queue"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498576"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100023720"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0497"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676569"},{"journal-title":"Graphs Hypergraphs","year":"1973","author":"berge","key":"1"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536326"},{"journal-title":"DeBruijn communication networks","year":"1974","author":"schlumberger","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676437"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/800053.801905"},{"key":"4","first-page":"590","article-title":"Fault diagnosis in boolean n-cube array of microprocessors","volume":"c30","author":"armstrong","year":"1981","journal-title":"IEEE Trans Comput"},{"key":"9","first-page":"400","article-title":"Fault tolerant multibus architecture for multiprocessors","author":"pradhan","year":"1984","journal-title":"Proc 14th Int Conference on Fault-Tolerant Computers"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676101"}],"event":{"name":"2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","start":{"date-parts":[[2014,10,1]]},"location":"Amsterdam, Netherlands","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6942523\/6962057\/06962102.pdf?arnumber=6962102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T21:20:34Z","timestamp":1490304034000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6962102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/dft.2014.6962102","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}