Maximum cliques in graphs with small intersection number and random intersection graphs

DOI10.1007/978-3-642-32589-2_63MaRDI QIDQ6827130zbMATH OpenFDO

Authors Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, P. G. Spirakis

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Maximum cliques in graphs with small intersection number and random intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827130)