1952 search results - page 48 / 391 » Complete partitions of graphs |
DM
2000
13 years 10 months ago
2000
For integers p; q; s with p
COCOON
2006
Springer
14 years 3 days ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
CGF
2008
13 years 10 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
PR
2000
2000
A region-level motion-based graph representation and labeling for tracking a spatial image partition
13 years 10 months ago
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...