{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:53:28Z","timestamp":1743011608957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653460"},{"type":"electronic","value":"9783030653477"}],"license":[{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65347-7_46","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T07:03:42Z","timestamp":1608361422000},"page":"556-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Congestion Due to Random Walk Routing"],"prefix":"10.1007","author":[{"given":"Onuttom","family":"Narayan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iraj","family":"Saniee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Marbukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. Math. 8, 399\u2013404 (1956)","journal-title":"Canadian J. Math."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P Elias","year":"1956","unstructured":"Elias, P., Feinstein, A., Shannon, C.: A note on the maximum flow through a network. IEEE Trans. Inf. Theory 2, 117\u2013119 (1956)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"TC Hu","year":"1963","unstructured":"Hu, T.C.: Multicommodity network flows. Op. Res. 11, 344\u2013360 (1963)","journal-title":"Op. Res."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(85)90004-6","volume":"11","author":"MV Lomonosov","year":"1985","unstructured":"Lomonosov, M.V.: Combinatorial approaches to multiflow problems. Discrete Appl. Math 11, 1\u201394 (1985)","journal-title":"Discrete Appl. Math"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F Shahrokhi","year":"1990","unstructured":"Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37, 318\u2013334 (1990)","journal-title":"J. ACM"},{"key":"46_CR6","unstructured":"Papernov, B.A.: Feasibility of multicommodity flows (in Russian). In: Friedman, A. (ed.) Studies in Discrete Optimization, pp. 230\u2013261. Idzat. \u201cNauka\", Moscow (1976)"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Combinatorial Theory Series B 31, 75\u201381 (1981)","journal-title":"J. Combinatorial Theory Series B"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M Minou","year":"1989","unstructured":"Minou, M.: Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313\u2013360 (1989)","journal-title":"Networks"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transp. Sci. 18, 1\u201355 (1984)","journal-title":"Transp. Sci."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: ACM Sigcomm 2003, pp. 313\u2013324 (2003)","DOI":"10.1145\/863955.863991"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"066108","DOI":"10.1103\/PhysRevE.84.066108","volume":"84","author":"O Narayan","year":"2011","unstructured":"Narayan, O., Saniee, I.: Large-scale curvature of networks. Phys. Rev. E 84, 066108 (2011)","journal-title":"Phys. Rev. E"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2010.554320","volume":"7","author":"EA Jonckheere","year":"2011","unstructured":"Jonckheere, E.A., Lou, M., Bonahon, F., Baryshnikov, Y.: Euclidean versus hyperbolic congestion in idealized versus experimental networks. Internet Math. 7, 1\u201327 (2011)","journal-title":"Internet Math."},{"key":"46_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman, M.E.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27, 39\u201354 (2005)","journal-title":"Soc. Netw."},{"key":"46_CR15","volume-title":"Spectral Graph Theory","author":"FRK Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)"},{"key":"46_CR16","first-page":"1","volume-title":"Combinatorics-Paul Erd\u00f6s is Eighty 2","author":"L Lovasz","year":"1993","unstructured":"Lovasz, L.: Random walks on graphs: a survey. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u00f4nyi, T. (eds.) Combinatorics-Paul Erd\u00f6s is Eighty 2, pp. 1\u201346. Janos Bolyai Mathematical Society, Keszthely (1993)"},{"key":"46_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/15427951.2014.1002640","volume":"11","author":"O Narayan","year":"2015","unstructured":"Narayan, O., Saniee, I., Tucci, G.H.: Lack of hyperbolicity in asymptotic Erd\u00f6s-R\u00e9nyi sparse random graphs. Internet Math. 11, 277\u2013288 (2015)","journal-title":"Internet Math."},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"036115","DOI":"10.1103\/PhysRevE.77.036115","volume":"77","author":"AN Samukhin","year":"2008","unstructured":"Samukhin, A.N., Dorogovtsev, S.N., Mendes, J.F.F.: Laplacian spectra of complex networks and random walks on them: are scale-free architectures really important? Phys. Rev. E 77, 036115 (2008)","journal-title":"Phys. Rev. E"},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"SN Dorogovtsev","year":"2000","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks: exact solution of the Barabasi-Albert model. Phys. Rev. Lett. 85, 4633\u20134636 (2000)","journal-title":"Phys. Rev. Lett."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65347-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:45:44Z","timestamp":1670373944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65347-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,20]]},"ISBN":["9783030653460","9783030653477"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65347-7_46","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2020,12,20]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}