In-place algorithms for computing a largest clique in geometric intersection graphs (Q2898007)
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: In-place algorithms for computing a largest clique in geometric intersection graphs |
scientific article; zbMATH DE number 6057346
| 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 6057346 |
Statements
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs (English)
0 references
16 July 2012
0 references
0.9954429864883424
0 references
0.7886639833450317
0 references
0.7769923210144043
0 references
0.7759580016136169
0 references
0.7734245657920837
0 references
