AUGMENTING UNDIRECTED NODE-CONNECTIVITY BY ONE

AUGMENTING UNDIRECTED NODE-CONNECTIVITY BY ONE

We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum-cost version for node-induced cost functions. [PUBLICATION ABSTRACT]

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics 2011-01, Vol.25 (1-2), p.695-718
1. Verfasser: VEGH, Laszlo A
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithms
Calculus of variations and optimal control
Combinatorics
Combinatorics. Ordered structures
Connectivity
Exact sciences and technology
Graph theory
Graphs
Mathematical analysis
Mathematics
Sciences and techniques of general use
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum-cost version for node-induced cost functions. [PUBLICATION ABSTRACT]
ISSN:0895-4801
1095-7146
DOI:10.1137/100787507