Author:
Melo Rafael A.,Ribeiro Celso C.,Riveaux Jose A.
Subject
Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software
Reference49 articles.
1. On maximum clique problems in very large graphs;Abello,1999
2. J. Abello, M. Resende, and S. Sudarsky. Massive quasi-clique detection. In J. Abello and J. Vitter, editors, Proceedings of the 5th Latin American Symposium on the Theory of Informatics, volume 2286 of Lecture Notes in Computer Science, pages 598–612. Springer, Berlin, 2002.
3. A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives;Bahiense;Discrete Appl. Math.,2014
4. A strong nash stability based approach to minimum quasi clique partitioning;Basu,2014
5. Solving longest common subsequence problems via a transformation to the maximum clique problem;Blum;Comput. Oper. Res.,2021
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献