Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(6 intermediate revisions by 5 users not shown) | |||
label / en | label / en | ||
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters | |||
Property / author | |||
Property / author: Ivan A. Bliznets / rank | |||
Property / author | |||
Property / author: Ivan A. Bliznets / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1706.09487 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Graph-Theoretic Approach to a Communications Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple upper bounds for partition functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Editing graphs into disjoint unions of dense clusters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A clustering algorithm based on graph connectivity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Highly Connected Subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximum quasi-clique problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On clique relaxation models in network analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club / rank | |||
Normal 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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:05, 30 July 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