An algorithm to increase the node-connectivity of a digraph by one

(2008) An algorithm to increase the node-connectivity of a digraph by one Discrete Optimization, 5 (4). pp. 677-684. ISSN 1572-5286

Copy

We develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-connected by adding a minimum number of new edges.

Item Type	Article
Keywords	graph algorithms,connectivity augmentation
Departments	Management
DOI	10.1016/j.disopt.2008.03.002
Date Deposited	25 Sep 2012 14:45
URI	https://researchonline.lse.ac.uk/id/eprint/45893

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