New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory

Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang. New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. In Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, editors, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. Volume 9235 of Lecture Notes in Computer Science, pages 151-162, Springer, 2015. [doi]

Abstract

Abstract is missing.