307 search results - page 48 / 62 » Finite locally-quasiprimitive graphs |
145
click to vote
JSYML
2010
15 years 26 days ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
216
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
152
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
195
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
163
click to vote
CONCUR
2009
Springer
16 years 19 days ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...