Computing a maximum clique in geometric superclasses of disk graphs (Q5918528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7603308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a maximum clique in geometric superclasses of disk graphs |
scientific article; zbMATH DE number 7603308 |
Statements
Computing a maximum clique in geometric superclasses of disk graphs (English)
0 references
18 October 2022
0 references
pseudo-disks
0 references
line transversals
0 references
intersection graphs
0 references
0 references
0.8862857818603516
0 references
0.8516349792480469
0 references
0.7734245657920837
0 references
0.7655492424964905
0 references
