Debroni, Jennifer; Eblen, John D.; Langston, Michael A.; Myrvold, Wendy; Shor, Peter; Weerapurage, Dinesh A complete resolution of the Keller maximum clique problem. (English) Zbl 1376.05109 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 129-135 (2011). Cited in 16 Documents MSC: 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) 05C75 Structural characterization of families of graphs 05C85 Graph algorithms (graph-theoretic aspects) PDFBibTeX XMLCite \textit{J. Debroni} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 129--135 (2011; Zbl 1376.05109) Full Text: Link