On finding two-connected subgraphs in planar graphs

Operations Research Letters

Volumn 20, Issue 2, 1997, Pages 81-84

  Provan, J Scott ^a  

^a The University of North Carolina at Chapel Hill   (United States)

Author keywords

Network survivability; Planar graph; Steiner tree; Two connected

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SET THEORY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

NETWORK SURVIVABILITY; PLANAR GRAPH; STEINER TREE; TWO CONNECTED SUBGRAPHS;

GRAPH THEORY;

EID: 0031076473     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(96)00046-6     Document Type: Article

References (13)

1. C. Alexopoulos, J.S. Provan, H.D. Ratliff and B.R. Stutzman, "Minimal connected enclosures on an embedded planar graph", Technical Report, ENC/OR/TR95-08, Department of Operations Research, University of North Carolina, Chapel Hill. (Postscript manuscript available by anonymous ftp under Technical Reports at WWW site http://www.or.unc.edu.) 1995.
2. M. Baïou and A.R. Mahjoub, "The 2-edge connected Steiner subgraph polytope of a series-parallel graph", Technical Report, Département d'Informatique, Université de Bretagne Occidentale, Brest, France, 1993.
3. R.E. Erickson, C.L. Monma and A.F. Veinott, "Send and split method for minimum-concave-cost network flows", Math. Oper. Res. 12, 634-664 (1987).
4. M.R. Garey, D.S. Johnson and R.E. Tarjan, "The planar Hamilonian circuit problem is NP-complete", SIAM J. Comput. 5, 704-714. (1976).
5. M. Grötschel and C.L. Monma, "Integer polyhedra arising from certain network design problems with connectivity constraints", SIAM J. Discrete Math. 3, 502-523 (1990).
6. F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
7. S. Khuller and U. Vishkin, "Biconnectivity approximations and graph carvings", J. ACM 41, 214-235 (1994).
8. C.L. Monma, B.S. Munson and W.R. Pulleyblank, "Minimum-weight two-connected spanning networks", Math. Programming 46, 153-171 (1990).
9. C.L. Monma and D.F. Shallcross, "Methods for designing communications networks with certain two-connected survivability constraints", Oper. Res. 37, 531-541 (1989).
10. J.S. Provan, "Convexity and the Steiner tree problem", Networks, 18, 55-72 (1988),
11. J.S. Provan, "Shortest enclosing walks and cycles in embedded graphs", Inform. Process. Lett. 30, 119-125 (1989).
12. K.T. Talluri, "Convexity and the generalized Steiner problem", Technical Report, Operations Research Center, Massachsetts Institute of Technology, Cambridge, MA, 1990.
13. P. Winter, "Generalized Steiner problem in series-parallel networks", J. Algorithms 7, 549-566 (1986).