Elsevier

Discrete Optimization

Volume 5, Issue 4, November 2008, Pages 677-684
Discrete Optimization

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

https://doi.org/10.1016/j.disopt.2008.03.002Get rights and content
Under an Elsevier user license
open archive

Abstract

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

Keywords

Graph algorithms
Connectivity augmentation

Cited by (0)

Research supported by the Hungarian National Foundation for Scientific Research Grant, OTKA T037547, K60802 and by European MCRTN ADONET, Grant Number 504438.