Augmenting undirected node-connectivity by one

Végh, László A. ORCID: 0000-0003-1152-200X (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.

Author

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
Divisions:	Management
Subjects:	Q Science > QA Mathematics
Date Deposited:	03 Oct 2012 09:06
Last Modified:	23 Oct 2024 04:42
URI:	http://eprints.lse.ac.uk/id/eprint/46408

Actions (login required)

View Item