Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...