Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...