Sciweavers

2283 search results - page 283 / 457
» Bounds of Graph Characteristics
Sort
View
CONCUR
2010
Springer
13 years 9 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
13 years 8 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
ORL
2008
99views more  ORL 2008»
13 years 8 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
GC
2007
Springer
13 years 8 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
APAL
2005
93views more  APAL 2005»
13 years 8 months ago
Logical aspects of Cayley-graphs: the group case
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...
Dietrich Kuske, Markus Lohrey