Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1998: Graph-Theoretic Concepts in Computer Science pp 272–284Cite as

Integral Uniform Flows in Symmetric Networks

(Extended Abstract)

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1517))

Abstract

We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of the automorphism group Aut(G) of G. The fractional solution is shown to be close to an integral solution (depending on properties of Aut(G)), and in particular becomes an integral solution for a class of graphs containing Cayley graphs. As an application we estimate asymptotically (up to error terms) the edge congestion of an optimal integral uniform flow (edge forwarding index) in the cube connected cycles and the butterfly.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awerbuch, B., Leighton, T.: A simple local control approximation algorithm for multicommodity flow. In: Proc. 34th Annual Symp. on Foundations of Computer Science, pp. 459–468 (1993)

    Google Scholar 

  2. Chung, E., Coffman, E., Reiman, M., Simon, B.: The forwarding index of communication networks. IEEE Trans. on Information Theory 33, 224–232 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Even, S., Itai, A., Shamir, A.: On the complexity of timeable and multicomodity flow problems. SIAM Journal on comp. 4(5), 691–703 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ford, L.R., Fulkerson, D.R.: Flows in network. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  5. Grigoriadis, M.D., Khachiyan, L.: Fast approximation schemes for convex programs. SIAM Journal on Optimization 4, 86–107 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kainen, P.C., White, A.T.: On stable crossing numbers. J. Graph Theory 2, 181–187 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Heydemann, M.C., Meyer, J.C., Opatrny, J., Sotteau, D.: On forwarding indices of k-connected graphs. Discrete Appl. Math 37/38, 287–296 (1992)

    Google Scholar 

  8. 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 Journal on Computing 3 3(23), 466–488 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.: Fast approximation algorithms for multicommodity flow problems. In: Proc. 23rd ACM Symp. on Theory of Computing, pp. 101–111 (1991)

    Google Scholar 

  10. Leighton, T., Maggs, B., Rao, S.: Universal packet routing algorithms. In: Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 256–269 (1988)

    Google Scholar 

  11. Leighton, F.T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)

    Google Scholar 

  12. Matula, D.W.: Concurrent flow and concurrent connectivity in graphs. In: Alavi, Y., et al. (eds.) Graph Theory and its Applications to Algorithms and Computer Science, pp. 543–559. Wiley, New York (1985)

    Google Scholar 

  13. Onaga, K.: A multicommodity flow theorem. Trans. IECE Japan 53-A(7), 350–356 (1970)

    MathSciNet  Google Scholar 

  14. Saad, R.: Complexity of the forwarding index problem. SIAM J. Discrete Math. 6, 413–427 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem, J. J. Assoc. for Computing Machinery 2(37), 318–334 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shahrokhi, F., Székely, 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)

    Google Scholar 

  17. Shahrokhi, F., Székely, L.A.: Concurrent flows and packet routing in Cayley graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 327–338. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  18. Shahrokhi, F., Székely, L.A.: On group invariant flows and applications. In: Alavi, Y., Schwenk, A. (eds.) Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, vol. 2, pp. 1033–1042. John Wiley and Sons, Inc., Chichester (1995)

    Google Scholar 

  19. Shahrokhi, F., Székely, L.A.: Canonical concurrent flows, crossing number and graph expansion, Combinatorics. Probability and Computing 3, 523–543 (1994)

    Google Scholar 

  20. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I.: The crossing number of a graph on a compact 2-manifold. Adv. Math. 123, 105–119 (1996)

    Google Scholar 

  21. Sýkora, O., Vrťo, I.: On the crossing number of hypercubes and cube connected cycles. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 214–218. Springer, Heidelberg (1992)

    Google Scholar 

  22. Sýkora, O., Vrťo, I.: Edge separators for graphs of bounded genus with applications. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 159–168. Springer, Heidelberg (1992); Also in Theoretical Computer Science 112, 419-429 (1993)

    Google Scholar 

  23. White, A.T.: Graphs, Groups and Surfaces. North-Holland, Amsterdam (1984)

    MATH  Google Scholar 

  24. White, A.T., Beineke, L.W.: Topological graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, pp. 15–50. Academic Press, London (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Texas, P.O.Box 311366, Denton, TX, 76203-1366, USA

    Farhad Shahrokhi

  2. Department of Mathematics, University of South Carolina, Columbia, SC, 29208, USA

    László A. Székely

Authors
  1. Farhad Shahrokhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. László A. Székely
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, ETH Zurich, ETH Zentrum, CH-8022, Zurich, Switzerland

    Juraj Hromkovič

  2. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shahrokhi, F., Székely, L.A. (1998). Integral Uniform Flows in Symmetric Networks. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_22

Download citation

  • DOI: https://doi.org/10.1007/10692760_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65195-6

  • Online ISBN: 978-3-540-49494-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation