What question did this study set out to answer?

The study aims to compute a maximum independent set in disk graphs where disks are placed in convex position.

June 10, 2026Open Access

Maximum Independent Sets in Disk Graphs with Disks in Convex Position

View Full Paper

Ask AI

Bookmark

Authors

Algorithm computes maximum independent set in disk graphs with disks in convex position, suggesting a faster solution for complex problems.

The study aims to compute a maximum independent set in disk graphs where disks are placed in convex position.
Developed an O(n³log n)-time algorithm for computing maximum independent sets.
Applicable to weighted disks, aiming to maximize total weight.
Provided an O(n³log² n)-time algorithm for solving the dispersion problem.
Achieved a maximum independent set efficiently in convex position disks.
Extended applicability to weighted disks with optimized computations.
Presented a new algorithm for maximizing minimum pairwise distances among selected disks.

Tkachenko et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark

Algorithm computes maximum independent set in disk graphs with disks in convex position, suggesting a faster solution for complex problems.