Splitting \(B_2\)-VPG Graphs into Outer-String and Co-Comparability Graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10389)

Abstract

A \(B_2\)-VPG representation of a graph is an intersection representation that consists of orthogonal curves with at most 2 bends. In this paper, we show that the curves of such a representation can be partitioned into \(O(\log n)\) groups that represent outer-string graphs or \(O(\log ^3 n)\) groups that represent permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on \(B_2\)-VPG graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection graphs of rays and grounded segments. Technical Report 1612.03638 [cs.DM], ArXiV (2016)Google Scholar
  2. 2.
    Cabello, S., Cardinal, J., Langerman, S.: The Clique Problem in Ray Intersection Graphs. Discrete & Computational Geometry 50(3), 771–783 (2013)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23–25, pp. 1161–1165. SIAM (2011)Google Scholar
  4. 4.
    Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 1st edn. Academic Press, New York (1980)Google Scholar
  5. 5.
    Martin Charles Golumbic: Doron Rotem, and Jorge Urrutia.: Comparability graphs and intersection graphs. Discrete Mathematics 43(1), 37–46 (1983)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Mark, J.: Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, and Martin Vatshelle.: An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60, 19–25 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Mark, J.: Keil and Lorna Stewart.: Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discrete Applied Mathematics 154(14), 1983–1995 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Lahiri, A., Mukherjee, J., Subramanian, C.R.: Maximum independent set on \(B_1\)-VPG graphs. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 633–646. Springer, Cham (2015). doi:10.1007/978-3-319-26626-8_46 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations