We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes
it an np-complete problem. Moreover, it requires bijective functions, which are often too …

Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …

Reachability queries on large directed graphs have attracted much attention recently. The
existing work either uses spanning structures, such as chains or trees, to compress the …

Efficient shortest path query answering in large graphs is enjoying a growing number of
applications, such as ranked keyword search in databases, social networks, ontology …

Given a large directed graph, rapidly answering reachability queries between source and
target nodes is an important problem. Existing methods for reachability trade-off indexing …

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 …

In this chapter, we will provide a survey of clustering algorithms for graph data. We will
discuss the different categories of clustering algorithms and recent efforts to design …

Due to rapid growth of the Internet technology and new scientific/technological advances,
the number of applications that model data as graphs increases, because graphs have high …

Reachability queries are a fundamental type of queries on graphs that find important
applications in numerous domains. Although a plethora of techniques have been proposed …