356 search results - page 3 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
WG
2010
Springer
13 years 4 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Position control devices enable precise selection, but significant clutching degrades performance. Clutching can be reduced with high control-display gain or pointer acceleration,...
ACIVS
2006
Springer
2006
Springer
Constrained Region-Growing and Edge Enhancement Towards Automated Semantic Video Object Segmentation
13 years 10 months ago
Most existing object segmentation algorithms suffer from a so-called under-segmentation problem, where parts of the segmented object are missing and holes often occur inside the ob...
JGT
2007
13 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
LATIN
2004
Springer
13 years 11 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...