Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs
Computational Geometry
2016-12-22 v1 Data Structures and Algorithms
Abstract
In this paper, we show that any -VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into outerstring graphs or permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on -VPG graphs.
Cite
@article{arxiv.1612.07276,
title = {Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs},
author = {Martin Derka and Therese Biedl},
journal= {arXiv preprint arXiv:1612.07276},
year = {2016}
}