Computing Mimicking Networks

  title={Computing Mimicking Networks},
  author={Shiva Chaudhuri and K. V. Subrahmanyam and Frank Wagner and Christos D. Zaroliagis},
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 [2 16 ] , S(5)=6 [2 32 ] . For bounded treewidth networks we show S(k)= O(k) [2^ 2 k ] , and for outerplanar networks we show S(k… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 14 references

Graph Minors. II. Algorithmic Aspects of Tree-Width

J. Algorithms • 1986
View 3 Excerpts
Highly Influenced

A Tourist Guide through Treewidth

Acta Cybern. • 1993
View 1 Excerpt

Network Flows

R. Ahuja, T. Magnanti, J. Orlin
Prentice-Hall, Englewood Cliffs, NJ • 1993
View 1 Excerpt

A Gomory-Hu Cut Tree Representation of a Netlist Partitioning Problem

A. Vanneli, S. W. Hadley
IEEE Transactions on Circuits and Systems , 37 • 1990
View 1 Excerpt

Algorithms for Integrated Circuit Layout

T. Lengauer, Combinatorial
View 3 Excerpts

Similar Papers

Loading similar papers…