Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
DOI10.1007/978-3-642-35261-4_49zbMATH Open1260.68177OpenAlexW61186060MaRDI QIDQ4909563FDOQ4909563
Authors: Danny Hermelin, Romeo Rizzi, 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
Recommendations
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Approximation algorithms for intersection graphs
- Approximation algorithms for intersection graphs
- scientific article; zbMATH DE number 19218
- Algorithms on subgraph overlap graphs
- On the intersection number of a graph
- On \(\alpha\)-overlap graphs
- An algorithm for the graph crossing number problem
- Approximation Algorithms for Geometric Intersection Graphs
- scientific article; zbMATH DE number 3908482
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)
Cited In (6)
- Fast constructive and improvement heuristics for edge clique covering
- Recognising the overlap graphs of subtrees of restricted trees is hard
- Overlap number of graphs
- On the kernel size of clique cover reductions for random intersection graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Algorithms on subgraph overlap graphs
This page was built for publication: Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909563)
