Article ID: | iaor20001725 |
Country: | Germany |
Volume: | 84 |
Issue: | 3 |
Start Page Number: | 555 |
End Page Number: | 563 |
Publication Date: | Jan 1999 |
Journal: | Mathematical Programming |
Authors: | Jordn T., Gyri E. |
Two extremal-type versions of the connectivity augmentation problem are investigated. Using ear-decomposition theorems we prove that (i) every 2-connected graph on