String graphs. II: Recognizing string graphs is NP-hard (Q1112845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: String graphs. II: Recognizing string graphs is NP-hard |
scientific article; zbMATH DE number 4079477
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String graphs. II: Recognizing string graphs is NP-hard |
scientific article; zbMATH DE number 4079477 |
Statements
String graphs. II: Recognizing string graphs is NP-hard (English)
0 references
1991
0 references
A graph is called a string graph if it is isomorphic to the intersection graph of a system of Jordan curves in the plane. It has been a long standing open problem whether string graphs can be recognized in polynomial time. Here we prove that recognizing string graphs and some related problems are NP-hard.
0 references
NP-hardness
0 references
graph recognition
0 references
string graph
0 references
intersection graph
0 references
0 references
0 references
0 references
0 references
0 references
0.8782692
0 references
0.87132275
0 references
0.87132275
0 references
0 references
