Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.MFCS.2017.6 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962698119 / rank | |||
Normal rank | |||
| Property / title | |||
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (English) | |||
| Property / title: Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.MFCS.2017.6 / rank | |||
Normal rank | |||
Latest revision as of 15:58, 30 December 2024
scientific article; zbMATH DE number 7204340
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
