Funder
council of scientific and industrial research, india
national board for higher mathematics
sponsored research and industrial consultancy
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference47 articles.
1. Adhikary, R., Bose, K., Mukherjee, S., Roy, B.: Complexity of maximum cut on interval graphs (2020). arXiv:2006.00061
2. Adhikary, R., Bose, K., Mukherjee, S., Roy, B.: Complexity of maximum cut on interval graphs. In: 37th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics, vol. 189, # 7. Leibniz-Zentrum für Informatik, Wadern (2021)
3. Asdre, K., Ioannidou, K., Nikolopoulos, S.D.: The harmonious coloring problem is NP-complete for interval and permutation graphs. Discrete Appl. Math. 155(17), 2377–2382 (2007)
4. Barahona, F.: The max-cut problem on graphs not contractible to $$K_5$$. Oper. Res. Lett. 2(3), 107–111 (1983)
5. Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493–513 (1988)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献