Cookies?
Library Header Image
LSE Research Online LSE Library Services

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

Frank, András and Végh , László A. (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.

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.
Library of Congress subject classification: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Management
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 25 Sep 2012 14:45
URL: http://eprints.lse.ac.uk/45893/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only