{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:28Z","timestamp":1725664048257},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:42Z","timestamp":1330263642000},"page":"327-337","source":"Crossref","is-referenced-by-count":1,"title":["Concurrent flows and packet routing in Cayley graphs (Preliminary version)"],"prefix":"10.1007","author":[{"given":"Farhad","family":"Shahrokhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laszl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"28_CR1","unstructured":"Chartrand, G., and Lesniak, L., Graphs and Digraphs, Wadsworth and Books\/Cole Mathematics Series, 1986."},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., and Shamir, A., On the complexity of timetable and multicommodity flow problems, SIAM J. Computing\n5(1976), 691\u2013703.","journal-title":"SIAM J. Computing"},{"key":"28_CR3","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"Ford, L. R., and Fulkerson, D. R., Flows in Networks, Princeton University Press, Princeton, 1962."},{"key":"28_CR4","first-page":"344","volume":"11","author":"T. C. Hu","year":"1963","unstructured":"Hu, T. C., Multi-commodity network flows, J. ORSA\n11(1963), 344\u2013360.","journal-title":"J. ORSA"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"L. Johnson","year":"1989","unstructured":"Johnson, L., and Ho, C. T., Optimal broadcasting and personalized communication in hypercubes, IEEE Trans. Comput.\n38(1989), 1249\u20131268.","journal-title":"IEEE Trans. Comput."},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N., A new polynomial time algorithm for linear programming, Combinatorica\n4(1984), 373\u2013395.","journal-title":"Combinatorica"},{"key":"28_CR7","first-page":"543","volume-title":"Graph Theory and its Applications to Algorithms and Computer Science","author":"D. W. Matula","year":"1985","unstructured":"Matula, D. W., Concurrent flow and concurrent connectivity in graphs, in: Graph Theory and its Applications to Algorithms and Computer Science, eds. Alavi, Y., et al., Wiley, New York, 1985, 543\u2013559."},{"key":"28_CR8","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, H., and Stieglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewdod-Cliffs, N. J., 1982."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Probabilistic construction of deterministic algorithms: approximating packing integer programs, Proc. 27th IEEE Symp. on the Foundations of Computer Sci., 1986, 10\u201318.","DOI":"10.1109\/SFCS.1986.45"},{"key":"28_CR10","unstructured":"Saad, R., Complexity of forwarding index problem, Universite de Paris-Sud, Lab. de Recherche en Informatique, Rapport No. 648, 1991."},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0743-7315(89)90045-2","volume":"6","author":"Y. Saad","year":"1989","unstructured":"Saad, Y., and Schultz, M. H., Data communication in hypercubes, J. Parallel and Distributed Computing\n6(1989), 115\u2013135.","journal-title":"J. Parallel and Distributed Computing"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"Shahrokhi, F., and Matula, D. W., The maximum concurrent flow problem, J. Assoc. for Computing Machinery\n37(1990), 318\u2013334.","journal-title":"J. Assoc. for Computing Machinery"},{"key":"28_CR13","unstructured":"Shahrokhi, F., and Sz\u00e9kely, L. A., Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in: Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25\u201327, 1992, by the Mathematical Programming Society, eds. E. Balas, G. Cournejols, R. Kannan, 102\u2013113, CMU Press, 1992."},{"key":"28_CR14","unstructured":"Shahrokhi, F., and Sz\u00e9kely, L. A., Formulae for the optimal congestion of the uniform concurrent multicommodity flow, submitted."},{"key":"28_CR15","volume-title":"Computational Aspects of VLSI","author":"J. D. Ullman","year":"1984","unstructured":"Ullman, J. D., Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984."},{"key":"28_CR16","volume-title":"Graphs, Groups and Surfaces","author":"A. T. White","year":"1984","unstructured":"White, A. T., Graphs, Groups and Surfaces, North-Holland, Amsterdam, 1984."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:40Z","timestamp":1619572180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}