de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Computing Mimicking Networks

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44233

Chaudhuri,  Shiva
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45570

Subrahmanyam,  K. V.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45681

Wagner,  Frank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45787

Zaroliagis,  Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)
There are no public fulltexts available
##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Chaudhuri, S., Subrahmanyam, K. V., Wagner, F., & Zaroliagis, C. (1998). Computing Mimicking Networks. In K. G. Larsen, S. Skyum, & G. Winskel (Eds.), Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98) (pp. 556-567). Berlin, Germany: Springer.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3776-5
##### Abstract
A {\em 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) \leq 10k-6~[k^22^{k+2}]$.