A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
From MaRDI portal
Publication:1799389
DOI10.1016/j.disopt.2013.08.004zbMath1506.05163OpenAlexW2164837129MaRDI QIDQ1799389
Noriyoshi Sukegawa, Atsushi Miyauchi
Publication date: 18 October 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.08.004
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work