Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
From MaRDI portal
Publication:4909563
DOI10.1007/978-3-642-35261-4_49zbMath1260.68177OpenAlexW61186060MaRDI QIDQ4909563
Romeo Rizzi, Danny Hermelin, Stéphane Vialette
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_49
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
On the kernel size of clique cover reductions for random intersection graphs ⋮ Fast constructive and improvement heuristics for edge clique covering
This page was built for publication: Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
