Memory allocation in information storage networks Conference Paper

abstract

• Given a graph G=(V,E) whose edges have lengths, the distance between two vertices u and v by d(u,v). For any vertex uV and any real number r, N(u,r) was defined as the set of vertices within distance r from u. It was assumed that G=(V,E) was a rooted tree, and assumed for any vV and for 1inv.

authors

• Jiang, Anxiao (Andrew)

published proceedings

• IEEE International Symposium on Information Theory - Proceedings

author list (cited authors)

• Jiang, A. A., & Bruck, J.

complete list of authors

• Jiang, AA||Bruck, J

publication date

• October 2003

start page

• 453