2314 search results - page 13 / 463 » Minimal Partitions of a Graph |
TCS
2010
13 years 6 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
PC
2008
13 years 8 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
CSC
2006
13 years 9 months ago
2006
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...