The Complexity of the Matching-Cut Problem
暂无分享,去创建一个
[1] Vasek Chvátal,et al. Recognizing decomposable graphs , 1984, J. Graph Theory.
[2] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..
[3] Satissed Now Consider. Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .
[4] Ioannis G. Tollis,et al. Graph Drawing , 1994, Lecture Notes in Computer Science.
[5] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[6] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[7] Maurizio Patrignani,et al. 3DCube: A Tool for Three Dimensional Graph Drawing , 1997, Graph Drawing.
[8] Walter Didimo,et al. Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size , 1999, GD.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .