Library Header Image
LSE Research Online LSE Library Services

Augmenting undirected node-connectivity by one

Végh, László A. (2010) Augmenting undirected node-connectivity by one. In: STOC 2010 - 42nd ACM Symposium on Theory of Computing, 6 - 8 June 2010, Cambridge, USA.

Full text not available from this repository.

Identification Number: 10.1145/1806689.1806767


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:
Additional Information: © 2010 ACM
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Management
Date Deposited: 11 Oct 2012 12:39
Last Modified: 31 Jan 2018 15:38

Actions (login required)

View Item View Item