
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
A graph G with n vertices is called an outerstring graph if it has an in...
read it

Grounded Lgraphs are polynomially χbounded
A grounded Lgraph is the intersection graph of a collection of "L" shap...
read it

String Art: Circle Drawing Using Straight Lines
An algorithm to generate the locus of a circle using the intersection po...
read it

On grounded Lgraphs and their relatives
We consider the graph class GroundedL corresponding to graphs that admi...
read it

Exact recovery of Planted Cliques in Semirandom graphs
In this paper, we study the Planted Clique problem in a semirandom mode...
read it

Assembling Omnitigs using HiddenOrder de Bruijn Graphs
De novo DNA assembly is a fundamental task in Bioinformatics, and findin...
read it

The Most Persistent SoftClique in a Set of Sampled Graphs
When searching for characteristic subpatterns in potentially noisy graph...
read it
Finding a Maximum Clique in a Grounded 1Bend String Graph
A grounded 1bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line ℓ and have exactly one endpoint on ℓ. We show that the problem of finding a maximum clique in a grounded 1bend string graph is APXhard, even for strictly ymonotone strings. For general 1bend strings, the problem remains APXhard even if we restrict the position of the bends and endpoints to lie on at most three parallel horizontal lines. We give fast algorithms to compute a maximum clique for different subclasses of grounded segment graphs, which are formed by restricting the strings to various forms of Lshapes.
READ FULL TEXT
Comments
There are no comments yet.