Asymptotic theory of greedy approximations to minimal $K$-point random graphs

Alfred O. Hero III and Olivier J. J. Michel
Tech. report TR 315, Univ. of Michigan, Communications & Signal Processing Lab., Sep 1998
IEEE Trans. Information Theory IT-45:1921–1939, Sep 1999


Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!