Dominating Sets and Induced Matchings in Orthogonal Ray Graphs

Asahi TAKAOKA  Satoshi TAYU  Shuichi UENO  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.12   pp.3101-3109
Publication Date: 2014/12/01
Publicized: 2014/09/09
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014EDP7184
Type of Manuscript: PAPER
Category: Fundamentals of Information Systems
Keyword: 
boolean-width,  dominating set,  induced matching,  orthogonal ray graphs,  strong edge coloring,  

Full Text: PDF>>
Buy this Article




Summary: 
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (closed half-lines) in the plane. Such a graph is 3-directional if every vertical ray has the same direction, and 2-directional if every vertical ray has the same direction and every horizontal ray has the same direction. We derive some structural properties of orthogonal ray graphs, and based on these properties, we introduce polynomial-time algorithms that solve the dominating set problem, the induced matching problem, and the strong edge coloring problem for these graphs. We show that for 2-directional orthogonal ray graphs, the dominating set problem can be solved in O(n2 log5 n) time, the weighted dominating set problem can be solved in O(n4 log n) time, and the number of dominating sets of a fixed size can be computed in O(n6 log n) time, where n is the number of vertices in the graph. We also show that for 2-directional orthogonal ray graphs, the weighted induced matching problem and the strong edge coloring problem can be solved in O(n2+m log n) time, where m is the number of edges in the graph. Moreover, we show that for 3-directional orthogonal ray graphs, the induced matching problem can be solved in O(m2) time, the weighted induced matching problem can be solved in O(m4) time, and the strong edge coloring problem can be solved in O(m3) time. We finally show that the weighted induced matching problem can be solved in O(m6) time for orthogonal ray graphs.