2125 search results - page 188 / 425 » On Graph Complexity |
122
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
115
click to vote
STACS
2010
Springer
15 years 10 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...
105
click to vote
CONCUR
2004
Springer
15 years 8 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...
139
click to vote
EUROPAR
2004
Springer
15 years 8 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...
125
click to vote
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...