Association for Computing Machinery (2010) Augmenting undirected node-connectivity by one. In: STOC 2010 - 42nd ACM Symposium on Theory of Computing, 2010-06-06 - 2010-06-08, Cambridge, United States, USA.
Full text not available from this repository.
Identification Number: 10.1145/1806689.1806767
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 |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 11 Oct 2012 12:39 |
| Last Modified: | 10 Nov 2024 03:57 |
| URI: | http://eprints.lse.ac.uk/id/eprint/45892 |
Actions (login required)
 |
View Item |
