A temporal graph is a graph in which vertices communicate with each other at specific time,
eg, A calls B at 11 am and talks for 7 minutes, which is modeled by an edge from A to B with …

As an important graph operator, reachability query has been extensively studied over
decades, which is to check whether a vertex can reach another vertex over a large directed …

Due to its wide applications, subgraph query has attracted lots of attentions in database
community. In this paper, we focus on subgraph query over a single large graph G, ie …

We propose TEDI, an indexing for solving shortest path, and k Nearest Neighbors (kNN)
problems. TEDI is based on the tree decomposition methodology. The graph is first …

In order to make model checking applicable to realistic problems, simplification techniques
are essential. Models may be simplified eliminating the variables that do not appear in the …

为了保护社会网络隐私信息, 提出了多种社会网络图匿名化技术. 图匿名化目的在于通过图修改
操作来防止隐私泄露, 同时保证匿名图在社会网络分析和图查询方面的数据可用性 …

Abstract Knowledge Discovery (KD) is a long-tradition field aiming at developing
methodologies to detect hidden patterns and regularities in large datasets, using techniques …

A temporal graph is a graph in which vertices communicate with each other at specific time,
eg, $ A $ calls $ B $ at 11 am and talks for 7 minutes, which is modeled by an edge from $ A …

Attributed graph is widely used for modeling a variety of information networks, such as the
web, sensor networks, biological networks, economic graphs, and social networks. Given …

In recent years, modeling data in graph structure became evident and effective for
processing in some of the prominent application areas like social analytics, health care …