Augmenting undirected node-connectivity by one

László Végh


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.

Older versions:

Bibtex entry:

AUTHOR = {V{\'e}gh, L{\'a}szl{\'o}},
TITLE = {Augmenting undirected node-connectivity by one},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {TR-2009-10}

Last modification: 26.5.2021. Please email your comments to Tamás Király!