Presentation 2014-07-09
Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
Asahi TAKAOKA, Satoshi TAYU, Shuichi UENO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. A 2-directional orthogonal ray graph is an intersection graph of rightward rays and downward rays. We recently showed in [12] that the weighted dominating set problem can be solved in O(n^4 log n) time for vertex-weighted 2-directional orthogonal ray graphs by using a new parameter, boolean-width of graphs, where n is the number of vertices in a graph. We improve the result by showing an O(n^3)-time algorithm to solve the problem based on a direct dynamic programming approach. We also show that the weighted induced matching problem can be solved in O(m^6) time for edge-weighted orthogonal ray graphs, where m is the number of edges in a graph.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Boolean-width / Dominating set / Dynamic programming / Induced matching / Orthogonal ray graphs
Paper # CAS2014-10,VLD2014-19,SIP2014-31,MSS2014-10,SIS2014-10
Date of Issue

Conference Information
Committee SIS
Conference Date 2014/7/2(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Smart Info-Media Systems (SIS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
Sub Title (in English)
Keyword(1) Boolean-width
Keyword(2) Dominating set
Keyword(3) Dynamic programming
Keyword(4) Induced matching
Keyword(5) Orthogonal ray graphs
1st Author's Name Asahi TAKAOKA
1st Author's Affiliation Department of Communications and Computer Engineering, Tokyo Institute of Technology()
2nd Author's Name Satoshi TAYU
2nd Author's Affiliation Department of Communications and Computer Engineering, Tokyo Institute of Technology
3rd Author's Name Shuichi UENO
3rd Author's Affiliation Department of Communications and Computer Engineering, Tokyo Institute of Technology
Date 2014-07-09
Paper # CAS2014-10,VLD2014-19,SIP2014-31,MSS2014-10,SIS2014-10
Volume (vol) vol.114
Number (no) 126
Page pp.pp.-
#Pages 4
Date of Issue