Computing a maximum clique in geometric superclasses of disk graphs
From MaRDI portal
Recommendations
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- In-place algorithms for computing a largest clique in geometric intersection graphs
- In-place algorithms for computing a largest clique in geometric intersection graphs
- Unit disk graphs
Cites work
- A unified approach to approximating resource allocation and scheduling
- Approximation and Online Algorithms
- Computing a maximum clique in geometric superclasses of disk graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Robust algorithms for restricted domains
- Sphere and dot product representations of graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Unit disk graphs
Cited in
(7)- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- In-place algorithms for computing a largest clique in geometric intersection graphs
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Finding a maximum clique in a disk graph
- The maximum clique problem in a disk graph made easy
- In-place algorithms for computing a largest clique in geometric intersection graphs
This page was built for publication: Computing a maximum clique in geometric superclasses of disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918528)
