{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:33:16Z","timestamp":1729661596594,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/istcs.1997.595161","type":"proceedings-article","created":{"date-parts":[[2002,11,22]],"date-time":"2002-11-22T20:23:27Z","timestamp":1037996607000},"page":"96-106","source":"Crossref","is-referenced-by-count":1,"title":["On the total\/sub k\/-diameter of connection networks"],"prefix":"10.1109","author":[{"given":"Y.","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"T.","family":"Eilam","sequence":"additional","affiliation":[]},{"given":"S.","family":"Moran","sequence":"additional","affiliation":[]},{"given":"S.","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90036-1","article-title":"Note on the k-diameter of k-regular k-connected graphs","volume":"133","author":"hsu","year":"1994","journal-title":"Discrete Mathematics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1991.153811"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1995.530745"},{"journal-title":"2-diameter of de-bruijn networks","year":"1995","author":"li","key":"ref13"},{"key":"ref14","first-page":"484","article-title":"Deterministic message routing in faulty hypercubes","author":"madhavapeddy","year":"1990","journal-title":"Lecture Notes in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.2194"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190503"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1991.218213"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"corman","key":"ref3"},{"year":"0","key":"ref6"},{"journal-title":"Subset connectivity and edge-disjoint trees with an application to target broadcasting","year":"1994","author":"dinitz","key":"ref5"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61769-8_13"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICAPP.1995.472218"},{"journal-title":"Augmented ring networks","year":"1996","author":"aiello","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73031"}],"event":{"name":"Fifth Israeli Symposium on Theory of Computing and Systems","acronym":"ISTCS-97","location":"Ramat-Gan, Israel"},"container-title":["Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx3\/4625\/13001\/00595161.pdf?arnumber=595161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T15:09:40Z","timestamp":1497539380000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/595161\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/istcs.1997.595161","relation":{},"subject":[]}}