Augmenting undirected node-connectivity by one

Végh, L. A.ORCID logo (2011). Augmenting undirected node-connectivity by one. SIAM Journal on Discrete Mathematics, 25(2), 695-718. https://doi.org/10.1137/100787507
Copy

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
Copyright holders © 2011 Society for Industrial and Applied Mathematics
Departments LSE > Academic Departments > Management
DOI 10.1137/100787507
Date Deposited 03 Oct 2012
URI https://researchonline.lse.ac.uk/id/eprint/46408

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics