Computing maximum cliques in unit disk graphs
From MaRDI portal
Cites work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A rectilinear steiner minimal tree algorithm for convex point sets
- A review on algorithms for maximum clique problems
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Expander-Based Approach to Geometric Optimization
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- An output sensitive algorithm for computing a maximum independent set of a circle graph
- Clique partitions, graph compression and speeding-up algorithms
- Clique relaxations in social network analysis: the maximum k-plex problem
- Connectivity of random k-nearest-neighbour graphs
- Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
- Dynamic unit-disk range reporting
- Efficient \(k\)-center algorithms for planar points in convex position
- Efficient Algorithms for Geometric Graph Search Problems
- Finding a maximum clique in a disk graph
- Finding k points with minimum diameter and related problems
- Finding maximum cliques on circular-arc graphs
- Finding tailored partitions
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Graph clustering
- Greedy and heuristic algorithms for codes and colorings
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- scientific article; zbMATH DE number 7691270 (Why is no real title available?)
- Improved algorithms for distance selection and related problems
- Improved bounds on weak ε-nets for convex sets
- Iterated nearest neighbors and finding minimal polytopes
- Maximum clique in disk-like intersection graphs
- Maximum flow and minimum-cost flow in almost-linear time
- Multi-neighborhood tabu search for the maximum weight clique problem
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Solving group technology problems via clique partitioning
- The clique problem in intersection graphs of ellipses and triangles
- The clique problem in ray intersection graphs
- The maximum clique problem in a disk graph made easy
- Unit disk graphs
- Unit-disk range searching and applications
This page was built for publication: Computing maximum cliques in unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313489)
