Yes, there are many algorithms to discover patterns in graph.
For example, there are several algorithms to discover frequent subgraphs in a graph or multiple graphs. Such algorithms are GSpan, FSG, etc. For an overview of frequent subgraph mining, here is an introduction to frequent subgraph mining
. Besides that people will also discover other types of patterns such as cliques in graphs.
Besides that, there are lot of other tasks that can be done with graphs such as community detection in social network, relational classification (inferring the labels of unlabelled nodes in a graph), studying the evolution of a graph, etc.
How is the performance? It depends on the algorithms and the type of graph. Some algorithms are certainly more scalable than others.
What kind of graph data do you want to analyze?
Edited 1 time(s). Last edit at 10/16/2018 01:33AM by webmasterphilfv.