Dominating Sets in Two-Directional Orthogonal Ray Graphs

摘要

A 2-directional orthogonal ray graph is an intersection graph of rightward rays (half-lines) and downward rays in the plane. We show a dynamic programming algorithm that solves the weighted dominating set problem in O(n(3)) time for 2-directional orthogonal ray graphs, where n is the number of vertices of a graph.