Login / Signup

Asymptotic theory of greedy approximations to minimal k-point random graphs.

Alfred O. Hero IIIOlivier J. J. Michel
Published in: IEEE Trans. Inf. Theory (1999)
Keyphrases
  • random graphs
  • graph theoretic
  • learning curves
  • greedy algorithm
  • phase transition
  • dynamic programming
  • probabilistic model
  • complex networks
  • laplace transform