Cookies?
Library Header Image
LSE Research Online LSE Library Services

Augmenting undirected node-connectivity by one

Végh, László A. (2011) Augmenting undirected node-connectivity by one. SIAM Journal on Discrete Mathematics, 25 (2). pp. 695-718. ISSN 0895-4801

Full text not available from this repository.

Identification Number: 10.1137/100787507

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: Article
Official URL: http://www.siam.org/journals/sidma.php
Additional Information: © 2011 Society for Industrial and Applied Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Management
Date Deposited: 03 Oct 2012 09:06
Last Modified: 03 Oct 2012 09:06
URI: http://eprints.lse.ac.uk/id/eprint/46408

Actions (login required)

View Item View Item