On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541)
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: On CLIQUE Problem for Sparse Graphs of Large Dimension |
scientific article; zbMATH DE number 6532598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On CLIQUE Problem for Sparse Graphs of Large Dimension |
scientific article; zbMATH DE number 6532598 |
Statements
On CLIQUE Problem for Sparse Graphs of Large Dimension (English)
0 references
19 January 2016
0 references
graph algorithms
0 references
sparse graphs
0 references
decomposition graph
0 references
atom graph
0 references
preprocessing
0 references
biphasic algorithms
0 references
treewidth
0 references
FPT-algorithms
0 references
0.92315245
0 references
0.9224746
0 references
0.9189136
0 references
0 references
0.91001284
0 references
0.9080942
0 references
0.9065954
0 references
0.9041125
0 references
0 references
