{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:26:20Z","timestamp":1787340380628,"version":"build-2736575974"},"reference-count":7,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1978,11]]},"abstract":"<jats:p>The following graph addressing problem was studied by Graham and Pollak in devising a routing scheme for Pierce\u2019s loop switching network. Let G be a graph with n vertices. It is desired to assign to each vertex $v_i $ an address in $\\{ 0,1, * \\} ^l $, such that the Hamming distance between the addresses of any two vertices agrees with their distance in G. Let $N(G)$ be the minimum length l for which an assignment is possible. It was shown by Graham and Pollak that $N(G) \\leqq m_G (n - 1)$, where $m_G $ is the diameter of G. In the present paper, we shall prove that $N(G) \\leqq 1.09(\\lg m_G )n + 8n$ by an explicit construction. This shows in particular that any graph has an addressing scheme of length $O(n\\log n)$.<\/jats:p>","DOI":"10.1137\/0207041","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:01:52Z","timestamp":1109224912000},"page":"515-523","source":"Crossref","is-referenced-by-count":3,"title":["On the Loop Switching Addressing Problem"],"prefix":"10.1137","volume":"7","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1972.tb02663.x"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90072-2"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02618.x"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067362"},{"key":"R5","volume-title":"The Art of Computer Programming","volume":"1","author":"Knuth D. E.","year":"1975"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321739"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1972.tb02646.x"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0207041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:32:19Z","timestamp":1787337139000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0207041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,11]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978,11]]}},"alternative-id":["10.1137\/0207041"],"URL":"https:\/\/doi.org\/10.1137\/0207041","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,11]]}}}