| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653854 | European Journal of Combinatorics | 2012 | 11 Pages |
Abstract
We analyse NN-separators in planar weighted graphs for any integer NN. The well-known result due to Lipton and Tarjan [5] is obtained in the case N=2N=2. The existence of an NN-separator is examined and the exact bounds for the best separation are demonstrated.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S.A. Tishchenko,