Végh , László A. (2010) Augmenting undirected node-connectivity by one. In: STOC 2010 - 42nd ACM Symposium on Theory of Computing, 6th-8th June 2010, Cambridge, USA.
Abstract
We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum cost version for node-induced cost functions.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://research.microsoft.com/en-us/um/newengland/... |
| Additional Information: | © 2010 ACM |
| Library of Congress subject classification: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Sets: | Departments > Management |
| Date Deposited: | 11 Oct 2012 12:39 |
| URL: | http://eprints.lse.ac.uk/45892/ |
Actions (login required)
 |
Record administration - authorised staff only |
