Algorithms for intersection graphs of c-intervals and c-pseudodisks

Keyphrases

• Disk-shaped 100%
• Intersection Graph 100%
• Polynomial Time 50%
• Interval Graphs 33%
• Geometric Objects 33%
• Existing Algorithms 16%
• NP-hard 16%
• Approximation Algorithms 16%
• Rectangle 16%
• Computational Geometry 16%
• Approximation Ratio 16%
• Jordan Domain 16%
• Algorithm Improvement 16%
• Tuple 16%
• Dominating Set 16%
• Union Complexity 16%
• Log-t 16%
• Maximum Weight Independent Set 16%
• Multiple Interval 16%
• Minimum Weight Dominating Set Problem 16%

Mathematics

• Intersection Graph 100%
• Polynomial Time 50%
• Dominating Set 33%
• Interval Graph 33%
• Geometric Object 33%
• Independent Set 16%