Sciweavers

2314 search results - page 24 / 463
» Minimal Partitions of a Graph
Sort
View
RSA
1998
105views more  RSA 1998»
13 years 8 months ago
The chromatic numbers of random hypergraphs
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
Michael Krivelevich, Benny Sudakov
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
14 years 2 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
ICCV
2011
IEEE
12 years 8 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...
JUCS
2002
131views more  JUCS 2002»
13 years 8 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
WG
2004
Springer
14 years 1 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki