2314 search results - page 191 / 463 » Minimal Partitions of a Graph |
136
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
137
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
121
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper proposes a new framework to image segmentation which combines edge- and region-based information with spectral techniques through the morphological algorithm of watersh...
143
click to vote
ICAS
2006
IEEE
15 years 10 months ago
2006
IEEE
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
147
Voted
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...