817 search results - page 26 / 164 » On 2-factors with k components |
179
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
This paper is concerned with online caching algorithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way...
160
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
137
click to vote
CPAIOR
2007
Springer
16 years 26 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
194
click to vote
ICRA
2005
IEEE
16 years 8 days ago
2005
IEEE
— The Intelligent Robotics Group at NASA Ames Research Center has developed a new mobile robot hardware architecture designed for extensibility and reconfigurability. Currently ...
154
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...