The complexity of the matching-cut problem

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

Volumn 2204, Issue , 2001, Pages 284-295

  Patrignani, Maurizio ^a   Pizzonia, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY;

LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; PLANAR GRAPH; SERIES-PARALLEL GRAPH;

GRAPH THEORY;

EID: 84945288064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_26     Document Type: Conference Paper

References (8)

1. V. Chvátal. Recogniziong decomposable graphs. J. Graph Theory, 8: 51-53, 1984.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
3. G. Di Battista, M. Patrignani, and F. Vargiu. A Split&Push approach to 3D orthogonal drawing. Journ. Graph Alg. Appl., 4: 105-133, 2000.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
5. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42: 1115-1145, 1995.
6. M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 284-290. Springer-Verlag, 1997.
7. T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annu. ACM Sympos. Theory Comput., pages 216-226, 1978.
8. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM J. Comput., 11(2): 298-313, 1982.