Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Reducibility among combinatorial problems;Karp,1972
2. Finding the maximal cut in a graph;Orlova;Eng. Cybern.,1972
3. Finding a maximum cut of a planar graph in polynomial time;Hadlock;SIAM J. Comput.,1975
4. Unifying maximum cut and minimum cut of a planar graph;Shih;IEEE Trans. Comput.,1990
5. Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs;Jansen;SIAM J. Comput.,2005
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献