823 search results - page 69 / 165 » Brick partitions of graphs |
138
click to vote
CSCWD
2008
Springer
15 years 8 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
155
click to vote
IPL
2008
15 years 6 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
154
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
180
click to vote
ORDER
2008
15 years 6 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...