The clique problem in ray intersection graphs (Q377488)
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: The clique problem in ray intersection graphs |
scientific article; zbMATH DE number 6223062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clique problem in ray intersection graphs |
scientific article; zbMATH DE number 6223062 |
Statements
The clique problem in ray intersection graphs (English)
0 references
6 November 2013
0 references
geometric intersection graphs
0 references
segment intersection graphs
0 references
maximum clique
0 references
NP-hardness
0 references
rays
0 references
halflines
0 references
subdivision
0 references
ray intersection graph
0 references
0 references
1.0000005960464478
0 references
0.7776684761047363
0 references
0.7763485908508301
0 references
0.7705375552177429
0 references
