Parameterized Complexity of Independence and Domination on Geometric Graphs [chapter]

Dániel Marx
2006 Lecture Notes in Computer Science  
We investigate the parameterized complexity of Maximum Independent Set and Dominating Set restricted to certain geometric graphs. We show that Dominating Set is W[1]-hard for the intersection graphs of unit squares, unit disks, and line segments. For Maximum Independent Set, we show that the problem is W[1]-complete for unit segments, but fixed-parameter tractable if the segments are axis-parallel.
doi:10.1007/11847250_14 fatcat:bd5ydgcicvc25cqq2ju3vdc35i