Marx, D. and O'Sullivan, B. and Razgon, Igor (2010) Treewidth reduction for constrained separation and bipartization problems. In: Marion, J.-Y. and Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics. Dagstuhl, Germany: Schloss Dagstuhl, pp. 561-572. ISBN 9783939897163.
Abstract
We present a method for reducing the treewidth of a graph while preserving all the minimal $s-t$ separators. This technique turns out to be very useful for establishing the fixed-parameter tractability of constrained separation and bipartization problems. To demonstrate the power of this technique, we prove the fixed-parameter tractability of a number of well-known separation and bipartization problems with various additional restrictions (e.g., the vertices being removed from the graph form an independent set). These results answer a number of open questions in the area of parameterized complexity.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 01 Aug 2013 15:27 |
| Last Modified: | 09 Aug 2023 12:34 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7919 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
