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

András Frank, László A. Végh

Research output: Contribution to journalArticle

6 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)677-684
Number of pages8
JournalDiscrete Optimization
Volume5
Issue number4
DOIs
Publication statusPublished - Nov 1 2008

Keywords

  • Connectivity augmentation
  • Graph algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An algorithm to increase the node-connectivity of a digraph by one'. Together they form a unique fingerprint.

  • Cite this