A note on the vertex-connectivity augmentation problem

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Using the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augmentation,J. Combin. Theory Ser. B63(1995), 8-20] ak-connected undirected graphG=(V,E) can be made (k+1)-connected by adding at mostk-2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slightly modified version of) this algorithm differs from the optimum by at most ⌈(k-1)/2⌉.

Original languageEnglish
Pages (from-to)294-301
Number of pages8
JournalJournal of Combinatorial Theory. Series B
Volume71
Issue number2
DOIs
Publication statusPublished - Nov 1 1997

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this