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 - Pseudo- - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2010-09-24 01:42:11 Open Document File Size: 216,02 KB Share Result on Facebook

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