2612 search results - page 243 / 523 » Switching Graphs and Their Complexity |
139
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— For many applications, the control of a complex nonlinear system can be made easier by modeling the system as a collection of simplified hybrid modes, each representing a part...
145
click to vote
STACS
2010
Springer
16 years 26 days 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...
131
click to vote
GD
2007
Springer
16 years 1 days 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 ...
143
Voted
CONCUR
2004
Springer
15 years 11 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...
172
click to vote
EUROPAR
2004
Springer
15 years 11 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...