Augmenting undirected node-connectivity by one

(2010) Augmenting undirected node-connectivity by one In: STOC 2010 - 42nd ACM Symposium on Theory of Computing, 2010-06-06 - 2010-06-08, Cambridge,United States,USA.

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	Conference or Workshop Item (Paper)
Copyright holders	© 2010 ACM
Keywords	node-connectivity, connectivity augmentation
Departments	Management
DOI	10.1145/1806689.1806767
Date Deposited	11 Oct 2012 12:39
URI	https://researchonline.lse.ac.uk/id/eprint/45892

Full text not available from this repository.

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads