Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane (Q3340176)
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: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane |
scientific article; zbMATH DE number 3874636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane |
scientific article; zbMATH DE number 3874636 |
Statements
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane (English)
0 references
1983
0 references
intersection graph
0 references
algorithm
0 references
components
0 references
maximum clique
0 references
rectangular region
0 references
rectangles
0 references
colorability
0 references
NP-complete
0 references
0.8306466341018677
0 references
0.8267733454704285
0 references
0.7886639833450317
0 references
0.7876330614089966
0 references
