Author:
Kobayashi Yasuaki,Kobayashi Yusuke,Miyazaki Shuichi,Tamaki Suguru
Publisher
Springer International Publishing
Reference25 articles.
1. Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nordic J. Comput. 7(1), 14–31 (2000)
2. Chimani, M., Dahn, C., Juhnke-Kubitzke, M., Kriegem, N.M., Mutzel, P., Nover, A.: Maximum Cut Parameterized by Crossing Number. arXiv:1903.06061 (2019)
3. Crowston, R., Jones, M., Mnich, M.: Max-cut parameterized above the Edwards-Erdös Bound. Algorithmica 72(3), 734–757 (2015)
4. Lecture Notes in Computer Science;C Dahn,2018
5. Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of STOC 1983, pp. 448–456 (1983)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献