Abstract
A B2-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(log3 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 B2-VPG graphs.
Cite
CITATION STYLE
Biedl, T., & Derka, M. (2017). Splitting B2-VPG graphs into outer-string and co-comparability graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10389 LNCS, pp. 157–168). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
