352 search results - page 62 / 71 » Partitioning Graphs into Connected Parts |
PERCOM
2010
ACM
15 years 3 months ago
2010
ACM
—Some current and future pervasive data driven applications must operate in ”extreme” environments where endto-end connectivity cannot be guaranteed at all times. In fact, it...
TALG
2010
14 years 10 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
100
click to vote
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...