Lower bounds on paraclique density

DOI10.1016/j.dam.2015.11.010zbMath1333.05220WikidataQ36763796 ScholiaQ36763796MaRDI QIDQ266841

F. Blanchet-Sadri, M. Dambrine

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.010

zbMATH Keywords

clustering; clique; graph density; paraclique

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C42: Density (toughness, etc.)

Uses Software

• Algorithm 457