In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534)
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 6343745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | In-place algorithms for computing a largest clique in geometric intersection graphs |
scientific article; zbMATH DE number 6343745 |
Statements
In-place algorithms for computing a largest clique in geometric intersection graphs (English)
0 references
12 September 2014
0 references
geometric intersection graphs
0 references
clique
0 references
in-place algorithms
0 references
bipartite matching
0 references
0 references
0 references
0 references
0.9954429864883424
0 references
0.7766006588935852
0 references
0.7675845623016357
0 references
0.7655492424964905
0 references
0.7618148326873779
0 references
