The maximum clique problem in multiple interval graphs (Q2350898)
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 6450390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum clique problem in multiple interval graphs |
scientific article; zbMATH DE number 6450390 |
Statements
The maximum clique problem in multiple interval graphs (English)
0 references
25 June 2015
0 references
\(t\)-interval graphs
0 references
\(t\)-track graphs
0 references
unit \(t\)-interval graphs
0 references
unit \(t\)-track graphs
0 references
maximum clique
0 references
NP-completeness
0 references
approximation hardness
0 references
0 references
0 references
0 references
0.9872998
0 references
0 references
0 references
0 references
0.9173577
0 references
0.9124797
0 references
