2612 search results - page 256 / 523 » Switching Graphs and Their Complexity |
206
click to vote
FOCS
2009
IEEE
16 years 21 days 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...
155
click to vote
IH
1999
Springer
15 years 10 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...
186
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
166
click to vote
CERA
2002
15 years 5 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...
147
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...