Lower bounds on paraclique density

DOI10.1016/J.DAM.2015.11.010zbMath1333.05220OpenAlexW2218939898WikidataQ36763796 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

clusteringcliquegraph densityparaclique

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Scalable parallel algorithms for FPT problems
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Lower bounds on paraclique density