Analyzing frequent subgraph mining (FSM) is considered as the most important challenge to graph mining domain. Many algorithms have been proposed for this problem. The plurality of these algorithms assumes that the graph data can be handled in computer memory. Actually, FSM is a primal operation in many applications such as Social Networks or chemical components, which contains a huge ... إقراء المزيد