4865 search results - page 482 / 973 » The Complexity of Graph Connectivity |
178
click to vote
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
193
click to vote
TVCG
2012
13 years 9 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
188
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
191
click to vote
ICWS
2004
IEEE
15 years 8 months ago
2004
IEEE
Service composition refers to the aggregation of services to build complex applications to achieve client requirements. It is an important challenge to make it possible for users ...
189
click to vote
PODC
2009
ACM
16 years 7 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...