Isolation concepts for efficiently enumerating dense subgraphs (Q837155)
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: Isolation concepts for efficiently enumerating dense subgraphs |
scientific article; zbMATH DE number 5602726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Isolation concepts for efficiently enumerating dense subgraphs |
scientific article; zbMATH DE number 5602726 |
Statements
Isolation concepts for efficiently enumerating dense subgraphs (English)
0 references
10 September 2009
0 references
NP-hard problem
0 references
parameterized complexity
0 references
fixed-parameter tractability
0 references
exact algorithm
0 references
clique
0 references
\(s\)-plex
0 references
0 references
0.99065953
0 references
0 references
0.8953202
0 references
0 references
0 references
0 references
0.8839998
0 references
