23 search results - page 3 / 5 » Bounds on the metric and partition dimensions of a graph |
FOCS
2005
IEEE
13 years 12 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
SIAMJO
2008
13 years 6 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
WG
2010
Springer
13 years 4 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
ICC
2008
IEEE
14 years 21 days ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...