Computing a maximum clique in geometric superclasses of disk graphs
From MaRDI portal
Publication:5918528
DOI10.1007/s10878-022-00853-2zbMath1504.90123OpenAlexW4228996779MaRDI QIDQ5918528
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00853-2
Cites Work
- Unnamed Item
- Unnamed Item
- Sphere and dot product representations of graphs
- Unit disk graphs
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Efficient algorithms for interval graphs and circular-arc graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A unified approach to approximating resource allocation and scheduling
- Approximation and Online Algorithms
- Computing a maximum clique in geometric superclasses of disk graphs