1952 search results - page 128 / 391 » Complete partitions of graphs |
143
click to vote
DAM
2007
15 years 4 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
167
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
123
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
175
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
147
click to vote
PCM
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...