2022
DOI: 10.48550/arxiv.2201.08498
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs?

Abstract: We explore what could make recognition of particular intersection-defined classes hard. We focus mainly on unit grid intersection graphs (UGIGs), i.e., intersection graphs of unit-length axis-aligned segments and grid intersection graphs (GIGs, which are defined like UGIGs without unit-length restriction) and string graphs, intersection graphs of arc-connected curves in a plane.We show that the explored graph classes are NP-hard to recognized even when restricted on graphs with arbitrarily large girth, i.e., l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 11 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?