Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220)
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: Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters |
scientific article; zbMATH DE number 7204340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters |
scientific article; zbMATH DE number 7204340 |
Statements
26 May 2020
0 references
clustering
0 references
parameterized complexity
0 references
highly connected clusters
0 references
0 references
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (English)
0 references
0.9322954
0 references
0.9322954
0 references
0.91851234
0 references
0.9121773
0 references
0.9080579
0 references
0.9057499
0 references
