An algorithm to increase the node-connectivity of a digraph by one☆
Under an Elsevier user license
open archive
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.
Copyright © 2008 Elsevier B.V. All rights reserved.