4865 search results - page 492 / 973 » The Complexity of Graph Connectivity |
194
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...
187
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
240
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
184
click to vote
IH
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
205
click to vote
CERA
2002
15 years 6 months ago
2002
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...