Skip to main content
SpringerLink
Log in

Computing mimicking networks

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

  • 176 Accesses

Abstract

A mimicking network for a k-terminal network, N, is one whose realizable external flows are the same as those of N. Let S(k) denote the minimum size of a mimicking network for a k-terminal network. In this paper we give new constructions of mimicking networks and prove the following results (the values in brackets are the previously best known results): S(4) = 5 [216], S(5) = 6 [232]. For bounded treewidth networks we show S(k) = O(k) [22k], and for outerplanar networks we show S(k) ≤ 10k − 6 [k 22k+2].

Supported by the Heisenberg program of the Deutsche Forschungsgemeinschaft.

Partially supported by the EU ESPRIT LTR Project No. 20244 (ALCOM-IT).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows Prentice-Hall, 1993.

    Google Scholar 

  2. S. Arikati, S. Chaudhuri, and C. Zaroliagis, All-Pairs Min-Cut in Sparse Networks, Journal of Algorithms, to appear; preliminary version in Found. of Software Technology and Theor. Comp. Science-FSTTCS'95, Lecture Notes in Computer Science Vol. 1026, Springer-Verlag, 1995, pp.363–376.

    Google Scholar 

  3. H. Bodlaender, A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth, SIAM Journal on Computing, 25 (1996), 1305–1317.

    Article  MATH  MathSciNet  Google Scholar 

  4. C.K. Cheng and T.C. Hu, Maximum Concurrent Flows and Minimum Cuts, Algorithmica, 8 (1992), 233–249.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Gusfield, Very Simple Methods for All Pairs Network Flow Analysis, SIAM Journal on Computing, 19 (1990), 143–155.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.E. Gomory and T.C. Hu, Multi-terminal network flows, Journal of SIAM, 9 (1961), 551–570.

    MATH  MathSciNet  Google Scholar 

  7. T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde, Characterizations of k- Terminal Flow Networks and Computing Network Flows in Partial k-Trees, in Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA '95) ACM-SIAM, 1995, pp. 641–649.

    Google Scholar 

  8. E. Ihler, F. Wagner, and D. Wagner, Modeling hypergraphs by graphs with the same mincut properties, Inform. Proc. Lett., 45 (1993), 171–175.

    Article  MATH  MathSciNet  Google Scholar 

  9. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner, Stuttgart and Wiley, Chichester, UK, 1990.

    Google Scholar 

  10. M.T. Shing and T.C. Hu, A Decomposition Algorithm for Multi-terminal Network Flows, Discrete Applied Mathematics, 13 (1986), 165–181.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Vanneli and S.W. Hadley, A Gomory-Hu cut tree representation of a netlist partitioning problem, IEEE Trans. Circuits and Systems, 37 (1990), 1133–1139.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Shiva Chaudhuri, K. V. Subrahmanyam & Christos D. Zaroliagis

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Frank Wagner

  3. Department of Computer Science, King's College, University of London, WC2R 2LS, Strand, London, UK

    Christos D. Zaroliagis

Authors
  1. Shiva Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. V. Subrahmanyam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos D. Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaudhuri, S., Subrahmanyam, K.V., Wagner, F., Zaroliagis, C.D. (1998). Computing mimicking networks. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055084

Download citation

  • DOI: https://doi.org/10.1007/BFb0055084

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation