M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SIAM International Conference on Data Mining (SDM-04), 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Motif Detection in Networks: Frequency Concepts.. - Schreiber.. (2004) (Correct)
No context found.
M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SIAM International Conference on Data Mining (SDM-04), 2004.
Towards Motif Detection in Networks: Frequency Concepts.. - Schreiber.. (2004) (Correct)
No context found.
M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SIAM International Conference on Data Mining (SDM-04), 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC