5100 search results - page 424 / 1020 » The Linear Complexity of a Graph |
198
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
184
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
175
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
181
click to vote
CONCUR
2004
Springer
16 years 1 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
216
click to vote
EUROPAR
2004
Springer
16 years 1 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...