Finding a Maximum Clique in a Grounded 1-Bend String Graph

07/12/2021
by   J. Mark Keil, et al.
0

A grounded 1-bend 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 1-bend string graph is APX-hard, even for strictly y-monotone strings. For general 1-bend strings, the problem remains APX-hard even if we restrict the position of the bends and end-points 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 L-shapes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2019

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...
research
08/12/2021

Grounded L-graphs are polynomially χ-bounded

A grounded L-graph is the intersection graph of a collection of "L" shap...
research
11/25/2008

String Art: Circle Drawing Using Straight Lines

An algorithm to generate the locus of a circle using the intersection po...
research
08/13/2018

On grounded L-graphs and their relatives

We consider the graph class Grounded-L corresponding to graphs that admi...
research
04/12/2016

Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard

We study the complexity of the problem of searching for a set of pattern...
research
05/14/2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs

De novo DNA assembly is a fundamental task in Bioinformatics, and findin...

Please sign up or login with your details

Forgot password? Click here to reset