Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

Discrete Applied Mathematics

Volumn 108, Issue 1-2, 2001, Pages 175-191

  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

EID: 0347870430     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00228-6     Document Type: Article

References (34)

1. 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-468.
2. Chung F., Coffman E., Reiman M., Simon B. The forwarding index of communication networks. IEEE Trans. Inform. Theory. 33:1987;224-232.
3. Even S., Itai A., Shamir A. On the complexity of timeable and multicommodity flow problems. SIAM J. Comput. 4(5):1976;691-703.
4. Fernandez de la Vega W., Márquez Gordones L. The forwarding indices of random graphs. Random Struct. Algorithms. 3(1):1992;107-116.
5. Ford L.R., Fulkerson D.R. Flows in Network. 1962;Princeton University Press, Princeton, NJ.
6. Gauyacq G. Edge-forwarding index of star graphs and other Cayley graphs. Discrete Appl. Math. 80:1997;149-160.
7. Grigoriadis M.D., Khachiyan L. Fast approximation schemes for convex programs. SIAM J. Optim. 4:1994;86-107.
8. Heydemann M.-C. Cayley graphs and interconnection networks. Hahn G., Sabidussi G. Algebraic Methods and Applications. NATO ASI Series C. Vol. 497:1997, 167-224 Kluwer, Dordrecht.
9. Heydemann M.-C., Meyer J.C., Sotteau D. On forwarding indices of networks. Discrete Appl. Math. 23:1989;103-123.
10. Heydemann M.-C., Meyer J.C., Opatrny J., Sotteau D. On forwarding indices of. k -connected graphs Discrete Appl. Math. 37 / 38:1992;287-296.
11. Kainen P.C., White A.T. On stable crossing numbers. J. Graph Theory. 2:1978;181-187.
12. Klein P., Plotkin S., Stein C., Tardos E. Faster approximation algorithms for unit capacity concurrent flow problems with applications to routing and sparsest cuts. SIAM J. Comput. 3(23):1994;466-488.
13. Leighton F.T. Complexity Issues in VLSI. 1983;MIT Press, Cambridge, MA.
14. 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-111.
15. T. Leighton, D. Maggs, S. Rao, Universal packet routing algorithms, Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 256-269.
16. 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-431.
17. Manoussakis Y., Tuza Z. The forwarding index of directed networks. Discrete Appl. Math. 68(3):1996;279-291.
18. Matula D.W. Concurrent flow and concurrent connectivity in graphs. Alavi Y.et al. Graph Theory and its Applications to Algorithms and Computer Science. 1985, 543-559 Wiley, New York.
19. Onaga K. A multicommodity flow theorem. Trans. IECE Japan. 53-A(7):1970;350-356.
20. 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-18.
21. Saad R. Complexity of the forwarding index problem. SIAM J. Discrete Math. 6:1993;413-427.
22. Shahrokhi F., Matula D.W. The maximum concurrent flow problem. J. Assoc. Comput. Mach. 2(37):1990;318-334.
23. F. Shahrokhi, L.A. Székely, 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.
24. Shahrokhi F., Székely L.A. Concurrent flows and packet routing in Cayley graphs. van Leeuwen J. Graph-Theoretic Concepts in Computer Science (Utrecht, 1993 ) Lecture Notes in Computer Science. Vol. 790:1994, 327-338 Springer, Berlin.
25. Shahrokhi F., Sýkora O., L.A. Székely O., Vrťo I. The crossing number of a graph on a compact 2-manifold. Adv. Math. 123:1996;105-119.
26. F. Shahrokhi, L.A. Székely, Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry, in: E. Balas, G. Cornuéjols, R. Kannan (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25-27, 1992, Mathematical Programming Society, CMU Press, 1992, pp. 102-113, Journal version: F. Shahrokhi, L.A. Székely, Canonical concurrent flows, crossing number and graph expansion, Combin. Probab. Comput. 3 (1994) 523-543.
27. F. Shahrokhi, L.A. Székely, Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry, in: E. Balas, G. Cornuéjols, R. Kannan (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25-27, 1992, Mathematical Programming Society, CMU Press, 1992, pp. 102-113, Journal version: F. Shahrokhi, L.A. Székely, Canonical concurrent flows, crossing number and graph expansion, Combin. Probab. Comput. 3 (1994) 523-543.
28. Shahrokhi F., Székely L.A. On group invariant flows and applications. Alavi Y., Schwenk A. Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol. 2. 1995, 1033-1042 Wiley, New York.
29. F. Shahrokhi, L.A. Székely, Integral uniform flows in symmetric networks, Graph-Theoretic Concepts in Computer Science (WG'98, Smolenice), Lecture Notes in Computer Science, pp. 272-284.
30. Sýkora O., Vrťo I. On the crossing number of hypercubes and cube connected cycles. Schmidt G., Berghammer R. Proceedings of the 17th International Workshop on Graph Theoretic Concepts in Computer Science WG'91. Lecture Notes in Computer Science. Vol. 570:1992, 214-218 Spinger, Berlin.
31. O. Sýkora, I. Vrťo, 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'91, Lecture Notes in Computer Science, Vol. 570, Springer, Berlin, 1992, pp. 159-168, Theoret. Comput. Sci. 112 (1993) 419-429.
32. O. Sýkora, I. Vrťo, 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'91, Lecture Notes in Computer Science, Vol. 570, Springer, Berlin, 1992, pp. 159-168, Theoret. Comput. Sci. 112 (1993) 419-429.
33. White A.T. Graphs, Groups and Surfaces. 1984;North-Holland, Amsterdam.
34. White A.T., Beineke L.W. Topological graph theory. Beineke L.W., Wilson R.J. Selected Topics in Graph Theory. 1978, 15-50 Academic Press, New York.