4171 search results - page 197 / 835 » Choice numbers of graphs |
158
click to vote
DM
2010
15 years 6 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
176
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
197
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
255
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
This paper presents a simple type system for thread-local data in Java. Classes and types are annotated to express thread-locality and unintended leaks are detected at compile-time...
170
click to vote
HAPTICS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we present a method for studying human selection of fingertip contact point locations during grasping and manipulation. Our aim is to perform a functional analysis,...