Loading...

K-Strong Conflict Free Coloring of Regions with Respect to a Family of Points

Daneshvar Amoli, Mohammad Reza | 2022

100 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 55462 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Abam, Mohammad Ali
  7. Abstract:
  8. The conflict-free coloring is one of the computational geometry problems that has received attention in the last two decades. The root of this problem comes from the frequency allocation problem to telecommunications antennas, where we have several telecommunication antennas in two-dimensional space aiming to assign to each of them a frequency so that every point on the plane, which is at least inside one of the antenna ranges, stays in a range with a frequency different from the other antennas containing point.One of the generalizations of this problem is the k-strong case, where we have n regions (equivalent to the circular region of the antennas) that we want to color so that for each point, k regions that contain the point can be colored differently from each other. Also, in this research we study 2-coloring conflict-free problems and introduce a polynomial time algorithm for them
  9. Keywords:
  10. Fault Tolerance ; Conflict-Free-Coloring ; Computational Geometry

 Digital Object List

 Bookmark

No TOC