4865 search results - page 477 / 973 » The Complexity of Graph Connectivity |
153
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
We present the integration of refinement method of VSE verification tool, successfully used in industrial applications, in the Heterogeneous Tool Set HETS. The connection is done v...
166
click to vote
STACS
2010
Springer
16 years 1 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...
148
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 ...
166
click to vote
CONCUR
2004
Springer
16 years 10 days 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...
201
click to vote
EUROPAR
2004
Springer
16 years 10 days 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...