Dr Berman Has "A Fine" Embedding
The recent issue of SIAM Journal of Discrete Math has an article by Dr Ken Berman that describes a new technique using algebraic graph theory that solves the problem of locating Internet servers to achieve optimal fault tolerance.
Dr Berman's paper is entitled " Locating Servers for Reliability
and Affine Embeddings", and appears in SIAM Journal on Discrete Mathematics, Vol. 21,
Issue 3, July 2007, pp. 637-646.
The paper appears online at http://link.aip.org/link/?SJD/21/637