by K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
http://www.smi.ernet.in/~kv/ps/mimic.ps.gz
Add To MetaCart
Abstract:
We further show that, for any k, a k-terminal bounded treewidth network has a mimicking network of size O(k). If in addition the input network is outerplanar, then we show that the resulting mimicking network is also outerplanar. All results constitute considerable improvements over previous approaches. 1
Citations
|
364
|
Combinatorical algorithms for integrated circuit layout. Applicable Theory
– Lengauer
- 1990
|
|
281
|
Graph minors II: Algorithmic aspects of treewidth
– Robertson, Seymour
- 1986
|
|
188
|
Efficient algorithms for combinatorial problems on graphs with bounded decomposability
– Arnborg
- 1985
|
|
174
|
A linear time algorithm for finding tree-decompositions of small treewidth
– Bodlaender
- 1996
|
|
13
|
Modeling hypergraphs by graphs with the same mincut properties
– Ihler, Wagner, et al.
- 1993
|
|
8
|
Characterizations of k-terminal flow networks and computing network flows in partial k-trees
– Hagerup, Katajainen, et al.
- 1995
|
|
4
|
A Gomory-Hu Cut Tree Representation of a Netlist Partitioning Problem
– Vannelli, Hadley
- 1990
|
|
3
|
Network Flows (Prentice-Hall
– Ahuja, Magnanti, et al.
- 1993
|
|
1
|
All-Pairs Min-Cut in Sparse Networks", Tech. Rep. MPI-I-96-1-007, Max-Planck-Institut fur Informatik, Saarbrucken
– Arikati, Chaudhuri, et al.
- 1996
|
|
1
|
A Tourist Guide through Treewidth", Acta Cybernetica
– Bodlaender
- 1993
|
