Independence free graphs and vertex connectivity augmentation

Journal of Combinatorial Theory. Series B

Volumn 94, Issue 1, 2005, Pages 31-77

  Jackson, Bill ^a   Jordán, Tibor ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Algorithms; Connectivity of graphs; Vertex connectivity augmentation

Indexed keywords

EID: 15444372084     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2004.01.004     Document Type: Article

References (22)

1. D. Bauer A. Morgana E. Schmeichel On the complexity of recognising tough graphs Discrete Math. 124 1994 13-17
2. G.R. Cai Y.G. Sun The minimum augmentation of any graph to a k-edge-connected graph Networks 19 1989 151-172
3. J. Cheriyan M.Y. Kao R. Thurimella Scan-first search and sparse certificates: An improved parallel algorithm for k-vertex connectivity SIAM J. Comput. 22 1993 157-174
4. J. Cheriyan R. Thurimella Fast algorithms for k-shredders and k-node connectivity augmentation J. Algorithms 33 1999 15-50
5. K.P. Eswaran R.E. Tarjan Augmentation problems SIAM J. Comput. 5 4 1976 653-665
6. A. Frank Augmenting graphs to meet edge-connectivity requirements SIAM J. Discrete Math. 5 1 1992 22-53
7. A. Frank, Connectivity augmentation problems in network design, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art, 1994, pp. 34-63.
8. A. Frank T. Jordán Minimal edge-coverings of pairs of sets J. Combin. Theory Ser. B 65 1995 73-110
9. E. Gyori T. Jordán How to make a graph four-connected Math. Programming 84 3 1999 555-563
10. S.L. Hakimi On realizability of a set of integers as degrees of the vertices of a linear graph. I J. Soc. Indust. Appl. Math. 10 1962 496-506
11. T.-S. Hsu On four-connecting a triconnected graph J. Algorithms 35 2000 202-234
12. T. Ishii H. Nagamochi On the minimum augmentation of an l-connected graph to a k-connected graph in: M.M. Halldórsson (Ed.) Proceedings of the SWAT 2000, Lecture Notes in Computer Science vol. 1851 2000 Springer Berlin 286-299
13. B. Jackson T. Jordán A near optimal algorithm for vertex-connectivity augmentation in: D.T. Lee S.-H. Teng (Eds.) Proceedings of the ISAAC 2000, Lecture Notes in Computer Science vol. 1969 2000 Springer Berlin 313-325
14. B. Jackson T. Jordán Non-separable detachments of graphs J. Combin. Theory Ser. B 87 2003 17-37
15. T. Jordán On the optimal vertex-connectivity augmentation J. Combin. Theory Ser. B 63 1995 8-20
16. T. Jordán A note on the vertex-connectivity augmentation problem J. Combin. Theory Ser. B 71 1997 294-301
17. T. Jordán Extremal graphs in connectivity augmentation J. Graph Theory 31 1999 179-193
18. W. Mader Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen Arch. Math. 23 1972 219-224
19. H. Nagamochi T. Ibaraki A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph Algorithmica 7 1992 538-596
20. H. Nagamochi Recent development of graph connectivity augmentation algorithms IEICE Trans. Inform. Syst. E83-D 3 2000
21. T. Watanabe A. Nakamura Edge-connectivity augmentation problems Comput. System Sci. 35 1 1987 96-144
22. T. Watanabe A. Nakamura A minimum 3-connectivity augmentation of a graph J. Comput. System Sci. 46 1 1993 91-128