2487 search results - page 156 / 498 » Partitions of Graphs into Trees |
165
Voted
PRDC
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
116
Voted
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...
112
Voted
CORR
2010
Springer
15 years 3 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...
120
Voted
IPL
2008
15 years 3 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...
125
Voted
COMBINATORICS
2007
15 years 3 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...