Dominating Sets and Induced Matchings in Orthogonal Ray Graphs

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(n 2 log 5 n) time, the weighted dominating set problem can be solved in O(n4 logn) time, and the number of dominating sets of a fixed size can be computed in O(n 6 logn) 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(n 2 + mlogn) 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(m 2 ) time, the weighted induced matching problem can be solved in O(m 4 ) time, and the strong edge coloring problem can be solved in O(m 3 ) time. We finally show that the weighted induced matching problem can be solved in O(m 6 ) time for orthogonal ray graphs.

[1]  A. Ershadi.  List homomorphisms and bipartite co-circular arc graphs , 2012 .

[2]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[3]  S. Lakshmivarahan,et al.  An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph , 1996, SIAM J. Comput..

[4]  Fang-Rong Hsu,et al.  An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs , 2000, Discret. Appl. Math..

[5]  Vijay V. Vazirani,et al.  NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..

[6]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[7]  C. Gregory Plaxton,et al.  Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs , 2013, ISAAC.

[8]  Martin Charles Golumbic,et al.  Irredundancy in Circular Arc Graphs , 1993, Discret. Appl. Math..

[9]  Andreas Brandstädt,et al.  The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs , 1987, Theor. Comput. Sci..

[10]  Jan Arne Telle,et al.  Boolean-Width of Graphs , 2009, IWPEC.

[11]  Patrice Belleville,et al.  Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs , 2004, Discret. Appl. Math..

[12]  R. Sritharan,et al.  Maximum induced matching problem on hhd-free graphs , 2012, Discret. Appl. Math..

[13]  Jeremy P. Spinrad,et al.  On the 2-Chain Subgraph Cover and Related Problems , 1994, J. Algorithms.

[14]  Stefan Felsner.  Tolerance graphs, and orders , 1998 .

[15]  Kathie Cameron,et al.  Finding a maximum induced matching in weakly chordal graphs , 2003, Discret. Math..

[16]  José A. Soto,et al.  Contributions on secretary problems, independent sets of rectangles and related problems , 2011 .

[17]  Satoshi Tayu,et al.  On orthogonal ray graphs , 2010, Discret. Appl. Math..

[18]  Ron Y. Pinter,et al.  Trapezoid graphs and their coloring , 1988, Discret. Appl. Math..

[19]  William T. Trotter,et al.  Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..

[20]  Yoshio Okamoto,et al.  Dominating Set Counting in Graph Classes , 2011, COCOON.

[21]  Andreas Brandstädt,et al.  Maximum Induced Matchings for Chordal Graphs in Linear Time , 2008, Algorithmica.

[22]  Martin Vatshelle,et al.  Graph classes with structured neighborhoods and algorithmic applications , 2011, Theor. Comput. Sci..

[23]  James R. Walter,et al.  Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[26]  Bruce A. Reed,et al.  Right angle free subsets in the plane , 1995, Graphs Comb..

[27]  Stefan Felsner,et al.  On the Recognition of Four-Directional Orthogonal Ray Graphs , 2013, MFCS.

[28]  Andreas Brandstädt,et al.  The induced matching and chain subgraph cover problems for convex bipartite graphs , 2007, Theor. Comput. Sci..

[29]  Madhav V. Marathe,et al.  Strong edge coloring for channel assignment in wireless radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[30]  Kathie Cameron,et al.  Induced Matchings in Intersection Graphs , 2000, Electron. Notes Discret. Math..

[31]  Nikola Milosavljevic.  On Complexity of Wireless Gathering Problems on Unit-Disk Graphs , 2011, ADHOC-NOW.

[32]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[33]  Tayu Satoshi,et al.  On Unit Grid Intersection Graphs , 2013 .

[34]  Peter C. Fishburn,et al.  Proper and Unit Tolerance Graphs , 1995, Discret. Appl. Math..

[35]  Jou-Ming Chang,et al.  Induced matchings in asteroidal triple-free graphs , 2003, Discret. Appl. Math..

[36]  Asahi Takaoka,et al.  On Two Problems of Nano-PLA Design , 2011, IEICE Trans. Inf. Syst..

[37]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1997, Discret. Appl. Math..

[38]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[39]  Mohammad Mahdian.  On the computational complexity of strong edge coloring , 2002, Discret. Appl. Math..

[40]  Jing Huang.  Representation characterizations of chordal bipartite graphs , 2006, J. Comb. Theory, Ser. B.

[41]  Dieter Kratsch,et al.  Independent Sets in Asteroidal Triple-Free Graphs , 1997, SIAM J. Discret. Math..

[42]  R. Sritharan,et al.  A Min–Max Property of Chordal Bipartite Graphs with Applications , 2010, Graphs Comb..

[43]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[44]  Peter Damaschke,et al.  Domination in Convex and Chordal Bipartite Graphs , 1990, Inf. Process. Lett..

[45]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[46]  Jan Arne Telle,et al.  Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems , 2013, Theor. Comput. Sci..

[47]  Madhav V. Marathe,et al.  The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks , 2004, IEEE Journal on Selected Areas in Communications.

[48]  Anish Man Singh Shrestha.  Study of orthogonal ray graphs with applications to nano-circuit design , 2011 .

[49]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[50]  Moshe Lewenstein,et al.  New results on induced matchings , 2000, Discret. Appl. Math..

[51]  Leen Stougie,et al.  Minimizing flow time in the wireless gathering problem , 2011, TALG.

[52]  José A. Soto,et al.  Jump Number of Two-Directional Orthogonal Ray Graphs , 2011, IPCO.