A polyhedral approach to planar augmentation and related problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 979, Issue , 1995, Pages 494-507

  Mutzel, Petra ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); INTEGER PROGRAMMING;

AUGMENTATION PROBLEMS; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; FACET-DEFINING INEQUALITIES; FACIAL STRUCTURE; LINEAR OBJECTIVE FUNCTIONS; POLYHEDRAL APPROACH; SUBGRAPH PROBLEMS;

GRAPH THEORY;

EID: 84947725280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60313-1_166     Document Type: Conference Paper

References (20)

1. Eswaran, K.P., and R.E. Tarjan: Augmentation problems. SIAM Journal on Computing 5 (1976) 653-665
2. Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Diser. Math. 5 (1992) 25-53
3. Garey, M.R., and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Franc. (1979)
4. Garg, N., V.S. Santosh, and A. Singla: Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. SODA (1993), 103-111
5. Goldschmldt, O. and A. Takvorlan: Finding a Bieonnected Spanning Planar Subgraph of a Nonplanar Graph. Technical Report ORP93-03, University of Texas, Austin, USA (1994)
6. Harary, F.: The maximum connectivity of a graph Proceed. of the National Academy of Sciences. USA 48 (1962) 1142-1146
7. Himsolt, M.: Konzeption und Implementierung yon Grapheneditoren. Dissertation, Universits Passau (1993)
8. Hoperoft, J., and R.E. Tarjan: Efficient planarity testing. J. ACM 21 (1974) 549-568
9. Jfinger, M. and P. Mutzel: Maximum planar subgraphs and nice erabeddings: Practical layout tools, to appear in Algorithmica, special issue on Graph Drawing, Ed. G. Di Battista und R. Tamassia (1994)
10. Jünger, M. and P. Mutzel: The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Leer. Notes in Comp. Sci 894, Proc. DIMACS GD'94, Ed. R. Tamassia and I.G. Tollis, Springer-Verlag, Princeton (1995) 119-130
11. Hsu, T.-S. and V. Ramachandran: A linear time algorithm for triconnectivity augmentation. Proc. 32th Annual Symp. on Found. Of Comp. Science, Puerto Rico (1991) 548-559
12. Kant, G.: Algorithms for Drawing Planar Graphs. Ph.D.-Thesis, Utrecht University (1993)
13. per ftp available at layoutlib@informatik.uni-koeln.de (1995)
14. Mutzel, P.: The Maximum Planar Subgraph Problem. Dissertation, Universits Köln (1994)
15. Mutzel, P.: s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope. Technical Report No. 94-161, Angewandte Mathematik und Informatik, Universität zu Köln (1994)
16. Ravi, R. and D.P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco (1995)
17. Rosenthal, A. and A. Goldner: Smallest augmentation to biconnect a graph. SIAM J. on Computing 6 (1977) 55-66
18. Stoer, M.: Design of Survivable Networks. Lecture Notes in Mathematics, Springer-Verlag, Berlin (1992)
19. Tamassia, R., G. Di Battista, and C. Batini: Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics 18 (1988) 61-79
20. Watanabe, T., and A. Nakamura: A minimum 3-connectivity augmentation of a graph. J. Comp. and Sys. Sci. 46 (1993) 91-128