Author:
Boyacı Arman,Ekim Tınaz,Shalom Mordechai
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Simple max-cut for split-indifference graphs and graphs with few P4's;Bodlaender,2004
2. On the complexity of the maximum cut problem;Bodlaender;Nord. J. Comput.,2000
3. SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s;Bodlaender;Electron. Notes Discrete Math.,1999
4. A short proof that ‘proper = unit’;Bogart;Discrete Math.,1999
5. A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs;Boyacı;Inf. Process. Lett.,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献