On the triangle clique cover and \(K_t\) clique cover problems
DOI10.1016/j.disc.2019.111627zbMath1429.05160arXiv1709.01590MaRDI QIDQ2279271
Gregory J. Puleo, Olgica Milenković, Hoang Dau
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.01590
intersection number; community detection; graph clustering; edge clique cover; Turan graph; triangle clique cover
90C35: Programming involving graphs or networks
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
