307 search results - page 17 / 62 » Finite locally-quasiprimitive graphs |
APAL
2005
13 years 9 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— This work proposes a control algorithm to stabilize a circular formation of AUVs tracking a time-varying center. We also consider the problem of uniform distribution of all the...
VECPAR
2000
Springer
14 years 1 months ago
2000
Springer
A dynamic domain decomposition strategy is proposed for the effective parallel implementation of combined finite/discrete element approaches for problems involving multi-fracture a...
JGT
2006
13 years 10 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...