Sciweavers

990 search results - page 126 / 198
» Sub-Graphs of Complete Graph
Sort
View
AIS
2004
Springer
13 years 11 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
CONCUR
2010
Springer
13 years 8 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 7 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...
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
DAM
2010
92views more  DAM 2010»
13 years 7 months ago
Average-case analysis of incremental topological ordering
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
Deepak Ajwani, Tobias Friedrich