A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On independent set on B1-EPG graphs
[article]
2015
arXiv
pre-print
In this paper we consider the Maximum Independent Set problem (MIS) on B_1-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in edgeintersinglebend as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted class B_k-EPG denotes EPG-graphs where every path has at most k bends. The study of MIS
arXiv:1510.00598v1
fatcat:uu6ymc23wnep7chkymxdytuww4