Funder
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico
Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference25 articles.
1. Adhikary, R., Bose, K., Mukherjee, S., Roy, B.: Complexity of maximum cut on interval graphs. In: 37th International Symposium on Computational Geometry. Leibniz Int. Proc. Inform., vol. 189, # 7. Leibniz-Zent. Inform., Wadern (2021)
2. Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Automata, Languages and Programming (Prague 1999). Lecture Notes in Computer Science, vol. 1644, pp. 200–209. Springer, Berlin (1999)
3. Bodlaender, H.L., de Figueiredo, C.M.H., Gutierrez, M., Kloks, T., Niedermeier, R.: Simple max-cut for split-indifference graphs and graphs with few $$P_4$$’s. In: 3rd International Workshop on Experimental and Efficient Algorithms (Angra dos Reis 2004). Lecture Notes in Computer Science, vol. 3059, pp. 87–99. Springer, Berlin (2004)
4. Bodlaender, H.L., Kloks, T., Niedermeier, R.: Simple max-cut for unit interval graphs and graphs with few $$P_4$$s. In: 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede 1999). Electronic Notes in Discrete Mathematics, vol. 3, pp. 19–26. Elsevier, Amsterdam (1999)
5. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graphs with at most two moplexes;Journal of Graph Theory;2024-05-08