1952 search results - page 67 / 391 » Complete partitions of graphs |
113
click to vote
COMBINATORICA
2006
15 years 4 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
150
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
149
click to vote
JCT
2010
15 years 2 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
169
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
140
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...