Computing densest \(k\)-subgraph with structural parameters (Q2680362)
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 7637580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing densest \(k\)-subgraph with structural parameters |
scientific article; zbMATH DE number 7637580 |
Statements
Computing densest \(k\)-subgraph with structural parameters (English)
0 references
29 December 2022
0 references
densest subgraphs
0 references
sparsest subgraphs
0 references
fixed parameter tractability
0 references
structural parameters
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.8444397449493408
0 references
0.838507354259491
0 references
0.8239797353744507
0 references
0.8153980374336243
0 references
0.7906989455223083
0 references
