On dominating set of some subclasses of string graphs
We provide constant factor approximation algorithms for the Minimum Dominating Set (MDS)
problem on several subclasses of string graphs ie intersection graphs of simple curves on …
problem on several subclasses of string graphs ie intersection graphs of simple curves on …
Arrangement Graphs and Intersection Graphs of Curves
U kant Sahoo - 2022 - dspace.isical.ac.in
An arrangement of a set of non-self-intersecting curves is their embedding in the Euclidean
plane such that at each intersection point the curves involved cross each other …
plane such that at each intersection point the curves involved cross each other …
Approximating independent set and dominating set on VPG graphs
We consider Independent Set and Dominating Set restricted to VPG graphs (or, equivalently,
string graphs). We show that they both remain $\mathsf {NP} $-hard on $ B_0 $-VPG graphs …
string graphs). We show that they both remain $\mathsf {NP} $-hard on $ B_0 $-VPG graphs …
Constrained orthogonal segment stabbing
Let $ S $ and $ D $ each be a set of orthogonal line segments in the plane. A line segment $
s\in S $\emph {stabs} a line segment $ s'\in D $ if $ s\cap s'\neq\emptyset $. It is known that …
s\in S $\emph {stabs} a line segment $ s'\in D $ if $ s\cap s'\neq\emptyset $. It is known that …