A 1-\((S,T)\)-edge-connectivity augmentation algorithm (Q1300058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 1-\((S,T)\)-edge-connectivity augmentation algorithm |
scientific article; zbMATH DE number 1332942
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 1-\((S,T)\)-edge-connectivity augmentation algorithm |
scientific article; zbMATH DE number 1332942 |
Statements
A 1-\((S,T)\)-edge-connectivity augmentation algorithm (English)
0 references
10 April 2000
0 references
In the literature is defined and studied the \(k\)-\((S,T)\)-edge-connectivity augmentation problem for digraphs, where \(k\) is a natural number and \(S\) and \(T\) are sets of vertices of a digraph. This paper describes a combinatorial polynomial algorithm which constructs a minimum set of augmentation edges for the special case where \(k=1\).
0 references
edge-connectivity
0 references
digraph
0 references
0.8570706844329834
0 references
0.8539402484893799
0 references
0.8329939246177673
0 references
