307 search results - page 28 / 62 » Finite locally-quasiprimitive graphs |
MP
1998
13 years 9 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
BIRTHDAY
2008
Springer
13 years 12 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
EJC
2010
13 years 10 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
RTA
1991
Springer
14 years 1 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...