An Efficient Algorithm for Enumerating Pseudo Cliques Takeaki Uno National Institute of Informatics 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan, Abstract. The problem of finding dense structures in

First Page		Document Content
Date: 2010-09-24 01:42:11		An Efficient Algorithm for Enumerating Pseudo Cliques Takeaki Uno National Institute of Informatics 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan, Abstract. The problem of finding dense structures in Add to Reading List Source URL: research.nii.ac.jp Download Document from Source Website File Size: 216,02 KB Share Document on Facebook