Clustering with local restrictions

Authors:
Daniel Lokshtanov;DáNiel Marx
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary
Venue:
Information and Computation
Year:
2013

Citing 23
Cited 0

Color-coding

Journal of the ACM (JACM)
On algorithmic applications of the immersion order

Discrete Mathematics - Special issue on Graph theory
Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Correlation Clustering

Machine Learning
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
The parameterized complexity of regular subgraph problems and generalizations

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
A more effective linear kernelization for cluster editing

Theoretical Computer Science
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

Algorithmica
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Fixed-Parameter Algorithms for Cluster Vertex Deletion

Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Correlation clustering with noisy input

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generalized graph clustering: recognizing (p, q)-cluster graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Operations Research
Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing

SIAM Journal on Discrete Mathematics
Editing Graphs into Disjoint Unions of Dense Clusters

Algorithmica
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion

Algorithmica
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let @m be a function on the subsets of vertices of a graph G. In the (@m,p,q)-Partition problem, the task is to find a partition of the vertices into clusters where each cluster C satisfies the requirements that (1) at most q edges leave C and (2) @m(C)=