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

Frank, András and Végh, László A. ORCID: 0000-0003-1152-200X (2008) An algorithm to increase the node-connectivity of a digraph by one. Discrete Optimization, 5 (4). pp. 677-684. ISSN 1572-5286

Full text not available from this repository.

• Author

Abstract

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
Official URL:	http://www.journals.elsevier.com/discrete-optimiza...
Additional Information:	© 2008 Elsevier B.V.
Divisions:	Management
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	25 Sep 2012 14:45
Last Modified:	31 Jan 2025 21:12
URI:	http://eprints.lse.ac.uk/id/eprint/45893

Actions (login required)

View Item