乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T02:56:48Z","timestamp":1705287408748},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0166-218x(00)00228-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:25:18Z","timestamp":1027607118000},"page":"175-191","source":"Crossref","is-referenced-by-count":9,"title":["Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem"],"prefix":"10.1016","volume":"108","author":[{"given":"Farhad","family":"Shahrokhi","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00228-6_BIB1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, T. Leighton, A simple local control approximation algorithm for multicommodity flow, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 459\u2013468.","DOI":"10.1109\/SFCS.1993.366841"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","article-title":"The forwarding index of communication networks","volume":"33","author":"Chung","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0166-218X(00)00228-6_BIB3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timeable and multicommodity flow problems","volume":"4","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(00)00228-6_BIB4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/rsa.3240030108","article-title":"The forwarding indices of random graphs","volume":"3","author":"Fernandez de la Vega","year":"1992","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB5","series-title":"Flows in Network","author":"Ford","year":"1962"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(97)00052-8","article-title":"Edge-forwarding index of star graphs and other Cayley graphs","volume":"80","author":"Gauyacq","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0804004","article-title":"Fast approximation schemes for convex programs","volume":"4","author":"Grigoriadis","year":"1994","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB8","series-title":"Algebraic Methods and Applications","first-page":"167","article-title":"Cayley graphs and interconnection networks","volume":"Vol. 497","author":"Heydemann","year":"1997"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","article-title":"On forwarding indices of networks","volume":"23","author":"Heydemann","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(92)90140-6","article-title":"On forwarding indices of k-connected graphs","volume":"37\/38","author":"Heydemann","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/jgt.3190020302","article-title":"On stable crossing numbers","volume":"2","author":"Kainen","year":"1978","journal-title":"J. Graph Theory"},{"issue":"23","key":"10.1016\/S0166-218X(00)00228-6_BIB12","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/S0097539792241175","article-title":"Faster approximation algorithms for unit capacity concurrent flow problems with applications to routing and sparsest cuts","volume":"3","author":"Klein","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB13","series-title":"Complexity Issues in VLSI","author":"Leighton","year":"1983"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB14","doi-asserted-by":"crossref","unstructured":"T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991, pp. 101\u2013111.","DOI":"10.1145\/103418.103425"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB15","doi-asserted-by":"crossref","unstructured":"T. Leighton, D. Maggs, S. Rao, Universal packet routing algorithms, Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 256\u2013269.","DOI":"10.1109\/SFCS.1988.21942"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB16","doi-asserted-by":"crossref","unstructured":"T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"issue":"3","key":"10.1016\/S0166-218X(00)00228-6_BIB17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(95)00072-Y","article-title":"The forwarding index of directed networks","volume":"68","author":"Manoussakis","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB18","series-title":"Graph Theory and its Applications to Algorithms and Computer Science","first-page":"543","article-title":"Concurrent flow and concurrent connectivity in graphs","author":"Matula","year":"1985"},{"issue":"7","key":"10.1016\/S0166-218X(00)00228-6_BIB19","first-page":"350","article-title":"A multicommodity flow theorem","volume":"53-A","author":"Onaga","year":"1970","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB20","doi-asserted-by":"crossref","unstructured":"P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 10\u201318.","DOI":"10.1109\/SFCS.1986.45"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0406033","article-title":"Complexity of the forwarding index problem","volume":"6","author":"Saad","year":"1993","journal-title":"SIAM J. Discrete Math."},{"issue":"37","key":"10.1016\/S0166-218X(00)00228-6_BIB22","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","article-title":"The maximum concurrent flow problem","volume":"2","author":"Shahrokhi","year":"1990","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB23","unstructured":"F. Shahrokhi, L.A. Sz\u00e9kely, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Department of Computer Science, University of North Texas, 1991."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB24","series-title":"Graph-Theoretic Concepts in Computer Science (Utrecht, 1993)","first-page":"327","article-title":"Concurrent flows and packet routing in Cayley graphs","volume":"Vol. 790","author":"Shahrokhi","year":"1994"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/aima.1996.0069","article-title":"The crossing number of a graph on a compact 2-manifold","volume":"123","author":"Shahrokhi","year":"1996","journal-title":"Adv. Math."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB26","unstructured":"F. Shahrokhi, L.A. Sz\u00e9kely, Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry, in: E. Balas, G. Cornu\u00e9jols, R. Kannan (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25\u201327, 1992, Mathematical Programming Society, CMU Press, 1992, pp. 102\u2013113, Journal version: F. Shahrokhi, L.A. Sz\u00e9kely, Canonical concurrent flows, crossing number and graph expansion, Combin. Probab. Comput. 3 (1994) 523\u2013543."},{"key":"10.1016\/S0166-218X(00)00228-6_BIB27","series-title":"Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol. 2","first-page":"1033","article-title":"On group invariant flows and applications","author":"Shahrokhi","year":"1995"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB28","doi-asserted-by":"crossref","unstructured":"F. Shahrokhi, L.A. Sz\u00e9kely, Integral uniform flows in symmetric networks, Graph-Theoretic Concepts in Computer Science (WG\u201998, Smolenice), Lecture Notes in Computer Science, pp. 272\u2013284.","DOI":"10.1007\/10692760_22"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB29","series-title":"Proceedings of the 17th International Workshop on Graph Theoretic Concepts in Computer Science WG\u201991","first-page":"214","article-title":"On the crossing number of hypercubes and cube connected cycles","volume":"Vol. 570","author":"S\u00fdkora","year":"1992"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB30","doi-asserted-by":"crossref","unstructured":"O. S\u00fdkora, I. Vr\u0165o, Edge separators for graphs of bounded genus with applications, in: G. Schmidt, R. Berghammer (Eds.), Proceedings of the 17th International Workshop on Graph Theoretic Concepts in Computer Science WG\u201991, Lecture Notes in Computer Science, Vol. 570, Springer, Berlin, 1992, pp. 159\u2013168, Theoret. Comput. Sci. 112 (1993) 419\u2013429.","DOI":"10.1016\/0304-3975(93)90031-N"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB31","series-title":"Graphs, Groups and Surfaces","author":"White","year":"1984"},{"key":"10.1016\/S0166-218X(00)00228-6_BIB32","series-title":"Selected Topics in Graph Theory","first-page":"15","article-title":"Topological graph theory","author":"White","year":"1978"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T15:48:20Z","timestamp":1579016900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0166218X00002286"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00228-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}