The maximum clique problem in a disk graph made easy
From MaRDI portal
Cites work
- An Expander-Based Approach to Geometric Optimization
- An output sensitive algorithm for computing a maximum independent set of a circle graph
- Clique partitions, graph compression and speeding-up algorithms
- Complexity of maximum cut on interval graphs
- Complexity of maximum cut on interval graphs
- Computing a maximum clique in geometric superclasses of disk graphs
- Computing maximum independent set on outerstring graphs and their relatives
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
- EPTAS for max clique on disks and unit balls
- Finding a maximum clique in a disk graph
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Graph-Theoretic Solutions to Computational Geometry Problems
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- scientific article; zbMATH DE number 4017764 (Why is no real title available?)
- scientific article; zbMATH DE number 3971629 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 7788411 (Why is no real title available?)
- Iterated nearest neighbors and finding minimal polytopes
- Maximum clique in disk-like intersection graphs
- On six problems posed by Jarik Nešetřil
- Robust algorithms for restricted domains
- Stabbing pairwise intersecting disks by four points
- Subexponential Parameterized algorithms on disk graphs (extended abstract)
- The clique problem in intersection graphs of ellipses and triangles
- The clique problem in ray intersection graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- Unit disk graphs
- Which problems have strongly exponential complexity?
This page was built for publication: The maximum clique problem in a disk graph made easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312711)
