Graph mining has become highly popular, especially in certain fields such as chemoinformatics, bioinformatics, and networks for social system. The important challenging task is to find all frequent subgraphs. Developing efficient algorithm for frequent subgraph mining is a challenging task. In this paper, a parallel algorithm for frequent graph mining, called “PFSG” algorithm based on FSG algorithm is proposed. It ... إقراء المزيد

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 ... إقراء المزيد

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable ... إقراء المزيد

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable ... إقراء المزيد