A note on the vertex-connectivity augmentation problem

Journal of Combinatorial Theory. Series B

Volumn 71, Issue 2, 1997, Pages 294-301

  Jordán, Tibor ^a,b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031281103     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1997.1786     Document Type: Article

References (4)

1. Cheriyan J., Thurimella R. Fast algorithms forkk. Proc. of the 28th ACM STOC. 1996;37-46.
2. Frank A. Connectivity augmentation problems in network design. Mathematical Programming: State of the Art 1994. 1994;The University of Michigan, Ann Arbor. p. 34-63.
3. Frank A., Jordán T. Minimal edge-coverings of pairs of sets. J. Combin. Theory Ser. B. 65:1995;73-110.
4. Jordán T. On the optimal vertex-connectivity augmentation. J. Combin. Theory Ser. B. 63:1995;8-20.