Integral uniform flows in symmetric networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 272-284

  Shahrokhi, Farhad ^a   Székely, László A ^b  

^a UNIVERSITY OF NORTH TEXAS   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMORPHISM GROUPS; CUBE-CONNECTED CYCLES; EDGE CONGESTION; FORWARDING INDEX; FRACTIONAL SOLUTIONS; INTEGRAL SOLUTIONS; MULTI-COMMODITY; SYMMETRIC NETWORK;

FLOW GRAPHS;

EID: 0002569879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_22     Document Type: Conference Paper

References (24)

1. Awerbuch, B., Leighton, T., A simple local control approximation algorithm for multicommodity flow, Proc. 34th Annual Symp. on Foundations of Computer Science, 1993, 459-468.
2. Chung, E., Coffman, E., Reiman M., Simon, B., The forwarding index of communication networks, IEEE Trans. on Information Theory, 33(1987), 224-232.
3. Even, S., Itai, A., and Shamir, A., On the complexity of timeable and multicomod-ity flow problems, SIAM Journal on comp., 4:5(1976), 691-703.
4. Ford, L. R, and Fulkerson, D. R., Flows in network, Princeton University Press, 1962.
5. Grigoriadis, M.D., Khachiyan, L., Fast approximation schemes for convex programs, SIAM Journal on Optimization 4(1994), 86-107.
6. Kainen, P. C., White, A. T., On stable crossing numbers, J. Graph Theory 2(1978) 181-187.
7. Heydemann, M. C., Meyer, J. C., Opatrny J., Sotteau, D., On forwarding indices of fc-connected graphs, Discrete Appl. Math. 37/38(1992), 287-296.
8. Klein, P., Plotkin, S., Stein, C., and Tardos, E., Faster approximation algorithms for unit capacity concurrent flow problems with applications to routing and sparsest cuts, SIAM Journal on Computing 3 23 (1994), 466-488.
9. Leighton, T., Makedon, F., Plotkin S., Stein, C., Tardos, E., Tragoudas, S., Fast approximation algorithms for multicommodity flow problems, Proc. 23rd ACM Symp. on Theory of Computing, 1991, 101-111.
10. Leighton, T., Maggs, B., Rao, S., Universal packet routing algorithms, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, 256-269.
11. Leighton, F. T., Complexity Issues in VLSI, MIT Press, Cambridge, Massachusetts, 1983.
12. Matula, D. W., Concurrent flow and concurrent connectivity in graphs, in Graph Theory and its Applications to Algorithms and Computer Science, ed. Alavi, Y., et al., Wiley, New York, 1985, 543-559.
13. Onaga, K., A multicommodity flow theorem, Trans. IECE Japan, 53-A, 7(1970), 350-356.
14. Saad, R., Complexity of the forwarding index problem, SIAM J. Discrete Math. 6(1993), 413-427.
15. Shahrokhi, F., and Matula, D. W., The maximum concurrent flow problem, J. Assoc. for Computing Machinery 2:37(1990), 318-33‑4.
16. Shahrokhi, F., and Szekely, L. A., An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Dept. Computer Science, Univ. of North Texas, 1991.
17. Shahrokhi, F., and Szekely, L. A., Concurrent flows and packet routing in Cayley graphs, in: Graph-Theoretic Concepts in Computer Science (Utrecht, 1993), ed. J. van Leeuwen, Lecture Notes in Computer Science Vol. 790, Springer Verlag, Berlin, 1994, 327-338.
18. Shahrokhi, F., and Szekely, L. A., On group invariant flows and applications, in: Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Volume 2 eds. Y. Alavi and A. Schwenk, John Wiley and Sons, Inc., 1995, 1033-1042.
19. Shahrokhi, F., Szekely, L. A., Canonical concurrent flows, crossing number and graph expansion, Combinatorics, Probability, and Computing 3 (1994), 523-543.
20. Shahrokhi, F., Sykora, O., Szekely, L. A., Vrto, I., The crossing number of a graph on a compact 2-manifold, Adv. Math. 123(1996), 105-119.
21. Sykora, O., Vrto, I., On the crossing number of hypercubes and cube connected cycles, in: Proc. 17th Intl. Workshop on Graph Theoretic Concepts in Computer Science WG'91, eds. G. Schmidt and R. Berghammer, LNCS 570, Spinger Verlag, Berlin, 1992, 214-218.
22. Sykora, O., Vrto, I., Edge separators for graphs of bounded genus with applications, in: Proc. 17th Intl. Workshop on Graph Theoretic Concepts in Computer Science WG'91, eds. G. Schmidt and R. Berghammer, LNCS 570, Springer Verlag, Berlin, 1992, 159-168, also in Theoretical Computer Science 112(1993), 419-429.
23. White, A. T., Graphs, Groups and Surfaces, North-Holland, Amsterdam, 1984.
24. White, A. T., Beineke, L. W., Topological graph theory, in: Selected Topics in Graph Theory, eds. L. W. Beineke and R. J. Wilson, Academic Press, 1978, 15-50.