307 search results - page 25 / 62 » Finite locally-quasiprimitive graphs |
105
click to vote
AI
2002
Springer
15 years 1 months ago
2002
Springer
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
124
click to vote
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
109
click to vote
COMBINATORICS
2007
15 years 1 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...
83
Voted
CG
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...