Jump Number of Two-Directional Orthogonal Ray Graphs

We model maximum cross-free matchings and minimum biclique covers of two-directional orthogonal ray graphs (2-dorgs) as maximum independent sets and minimum hitting sets of an associated family of rectangles in the plane, respectively. We then compute the corresponding maximum independent set using linear programming and uncrossing techniques. This procedure motivates an efficient combinatorial algorithm to find a cross-free matching and a biclique cover of the same cardinality, proving the corresponding min-max relation. We connect this min-max relation with the work of Gyori [19], Lubiw[23], and Frank and Jordan [16] on seemingly unrelated problems. Our result can be seen as a non-trivial application of Frank and Jordan's Theorem. As a direct consequence, we obtain the first polynomial algorithm for the jump number problem on 2-dorgs. For the subclass of convex graphs, our approach is a vast improvement over previous algorithms. Additionally, we prove that the weighted maximum cross-free matching problem is NP-complete for 2-dorgs and give polynomial algorithms for some subclasses.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

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

[3]  Haiko Müller,et al.  Alternating cycle-free matchings , 1990 .

[4]  András Frank,et al.  Finding Minimum Generators of Path Systems' , 1999, J. Comb. Theory, Ser. B.

[5]  Satoshi Tayu,et al.  On two-directional orthogonal ray graphs , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[6]  Ervin Györi,et al.  A minimax theorem on intervals , 1984, J. Comb. Theory, Ser. B.

[7]  Andreas Brandstädt,et al.  The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions , 1989, FCT.

[8]  D. Kleitman,et al.  Covering Regions by Rectangles , 1981 .

[9]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Steven Skiena,et al.  Optimizing combinatorial library construction via split synthesis , 1999, RECOMB.

[13]  András A. Benczúr,et al.  Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems , 2003, Discret. Appl. Math..

[14]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[15]  Donald E. Knuth.  Irredundant intervals , 1996, JEAL.

[16]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[17]  Stéphan Ceroi,et al.  A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete , 2003, Order.

[18]  András Frank,et al.  Minimal Edge-Coverings of Pairs of Sets , 1995, J. Comb. Theory B.

[19]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[20]  Jérôme Amilhastre,et al.  Computing a minimum biclique cover is polynomial for bipartite domino-free graphs , 1997, SODA '97.

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Heiner Fauck,et al.  Covering Polygons with Rectangles via Edge Coverings of Bipartite Permutation Graphs , 1991, Journal of Information Processing and Cybernetics.

[23]  George Steiner,et al.  A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders , 1987 .

[24]  Stéphan Ceroi.  Ordres et géométrie plane : application au nombre de sauts , 2000 .

[25]  András Frank,et al.  An algorithm to increase the node-connectivity of a digraph by one , 2008, Discret. Optim..

[26]  Anna Lubiw,et al.  A weighted min-max relation for intervals , 1990, J. Comb. Theory, Ser. B.

[27]  Dana S. Nau,et al.  A mathematical analysis of human leukocyte antigen serology , 1978 .

[28]  Daniel J. Kleitman,et al.  An Algorithm for Covering Polygons with Rectangles , 1986, Inf. Control..

[29]  Haiko Müller,et al.  On edge perfectness and classes of bipartite graphs , 1996, Discret. Math..

[30]  László A. Végh.  Connectivity augmentation algorithms , 2010 .

[31]  Yota Otachi,et al.  Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs , 2007, Discret. Appl. Math..

[32]  Michel Morvan,et al.  Orders, Algorithms, and Applications , 1994, Lecture Notes in Computer Science.

[33]  Elias Dahlhaus,et al.  The Computation of the Jump Number of Convex Graphs , 1994, ORDAL.

[34]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[35]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .