Author： Horváth Tamás
Publisher： Springer Publishing Company
ISSN： 1384-5810
Source： Data Mining and Knowledge Discovery, Vol.21, Iss.3, 2010-11, pp. : 472-508
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Heuristics for the Maximum Outerplanar Subgraph Problem
By Poranen Timo
Journal of Heuristics, Vol. 11, Iss. 1, 2005-01 ,pp. :
Access to resources
Recommend
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
By Inokuchi A.
Machine Learning, Vol. 50, Iss. 3, 2003-03 ,pp. :
Periodic subgraph mining in dynamic networks
By Lahiri Mayank Berger-Wolf Tanya
Knowledge and Information Systems, Vol. 24, Iss. 3, 2010-09 ,pp. :
Constructing the highest degree subgraph for dense graphs is in NCAS
By Andreev A.E. Clementi A.E.F. Rolim J.D.P.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :