1952 search results - page 268 / 391 » Complete partitions of graphs |
133
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
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...
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
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...
165
click to vote
DAM
2010
15 years 6 months ago
2010
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...
165
click to vote
DISOPT
2006
15 years 6 months ago
2006
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
187
click to vote
INFORMATICALT
2008
15 years 6 months ago
2008
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....