{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:50Z","timestamp":1740103850813,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10951-024-00823-y","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T18:04:01Z","timestamp":1729188241000},"page":"557-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Network routing on regular digraphs and their line graphs"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5125-6979","authenticated-orcid":false,"given":"Vance","family":"Faber","sequence":"first","affiliation":[]},{"given":"Noah","family":"Streib","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"823_CR1","unstructured":"Chishwashwa, N., Faber, V., & Streib, N. (2022). Digraph networks and groupoids. arXiv:2208.10537"},{"key":"823_CR2","unstructured":"Combinatorics Wiki. (2019). Degree-diameter problem for general digraphs. http:\/\/combinatoricswiki.org\/wiki\/The_Degree_Diameter_Problem_for_General_Digraphs. Last edited 3 January 2019."},{"key":"823_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.18052\/www.scipress.com\/BMSA.20.9","volume":"20","author":"Randall Dougherty","year":"2014","unstructured":"Dougherty, Randall, & Faber, Vance. (2014). Network routing on regular directed graphs from spanning factorizations. Bulletin of Mathematical Sciences and Applications, 20, 9\u201324.","journal-title":"Bulletin of Mathematical Sciences and Applications"},{"key":"823_CR4","doi-asserted-by":"crossref","unstructured":"Fiol, M., Yebra, J. L., & Alegre, I. (1984). Line digraph iterations and the (d, k) digraph problem. IEEE Transactions on Computers, C\u201333, 400\u2013403.","DOI":"10.1109\/TC.1984.1676455"},{"key":"823_CR5","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama, A., Karypis, G., Kumar, V., & Gupta, A. (2003). Introduction to parallel computing (2nd ed.). Addison-Wesley.","edition":"2"},{"key":"823_CR6","doi-asserted-by":"crossref","unstructured":"Harris, D.G., & Srinivasan, A. (2013). The Moser\u2013Tardos framework with partial resampling. In 2013 IEEE 54th annual symposium on foundations of computer science (pp. 469\u2013478).","DOI":"10.1109\/FOCS.2013.57"},{"key":"823_CR7","doi-asserted-by":"crossref","unstructured":"Leighton, T., & Maggs, B. (1995). Fast algorithms for finding $$O$$(congestion$$+$$dilation) packet routing schedules. In Proceedings of the twenty-eighth annual Hawaii international conference on system sciences, vol. 2 (pp. 555\u2013563).","DOI":"10.1109\/HICSS.1995.375501"},{"key":"823_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"FT Leighton","year":"1994","unstructured":"Leighton, F. T., Maggs, B. M., & Rao, S. (1994). Packet routing and job-shop scheduling in $$O$$(congestion$$+$$dilation) steps. Combinatorica, 14, 167\u2013186.","journal-title":"Combinatorica"},{"key":"823_CR9","doi-asserted-by":"crossref","unstructured":"Leonard, J., Purkayastha, A., Reilly, M., & Mohan, T. (2007). The software interface for a cluster interconnect based on the Kautz digraph. In 2007 IEEE International conference on cluster computing (pp. 187\u2013193).","DOI":"10.1109\/CLUSTR.2007.4629231"},{"key":"823_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"JY-T Leung","year":"2004","unstructured":"Leung, J.Y.-T. (2004). Handbook of scheduling: Algorithms, models, and performance analysis. Chapman & Hall\/CRC."},{"key":"823_CR11","doi-asserted-by":"crossref","unstructured":"Li, D., Lu, X., & Su, J. (2004). Graph-theoretic analysis of Kautz topology and DHT schemes. In IFIP international conference on network and parallel computing.","DOI":"10.1007\/978-3-540-30141-7_45"},{"key":"823_CR12","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/12.805162","volume":"48","author":"Geetha Panchapakesan","year":"1999","unstructured":"Panchapakesan, Geetha, & Sengupta, Abhijit. (1999). On a lightweight network topology using Kautz digraphs. IEEE Transactions on Computers, 48, 1131\u20131138.","journal-title":"IEEE Transactions on Computers"},{"key":"823_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12450-1_20","volume-title":"Approximation and online algorithms","author":"B Peis","year":"2010","unstructured":"Peis, B., Skutella, M., & Wiese, A. (2010). Packet routing: Complexity and algorithms. In E. Bampis & K. Jansen (Eds.), Approximation and online algorithms (pp. 217\u2013228). Springer."},{"key":"823_CR14","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T. (2012). A simpler proof for $$O$$(congestion$$+$$dilation) packet routing. CoRR arXiv:1206.3718","DOI":"10.1007\/978-3-642-36694-9_29"},{"key":"823_CR15","unstructured":"Taylor, W., Leonard, J., & Stewart, L. (2011). Efficient tilings of de Bruijn and Kautz graphs. Computing Research Repository\u2014CORR, 01."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00823-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00823-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00823-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T13:03:49Z","timestamp":1731762229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00823-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["823"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00823-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"14 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}