Login / Signup

Upper and lower bounds for graph-diameter problems with application to record allocation.

Daniel S. HirschbergC. K. Wong
Published in: J. Comb. Theory, Ser. B (1979)
Keyphrases
  • upper and lower bounds
  • upper bound
  • lower bound
  • resource allocation
  • graph theory
  • data sets
  • data mining
  • pairwise
  • special case
  • small number
  • collaborative filtering
  • weighted graph