Directed graphs are prevalent in social networks, web networks, and communication
networks. A well-known concept of the directed graph is the D-core, or (k, l)-core, which is …

Maximal k-plex enumeration is an important problem in graph analysis and can find many
real-world applications. A k-plex is a subgraph in which every vertex can miss edges to at …

Many real-world binary relations can be modelled as bipartite graphs, which can be
inherently temporal and each edge is associated with a timestamp. The (α, β)-core, a …

Temporal community search is an important task in graph analysis, which has been widely
used in many practical applications. However, existing methods suffer from two major …

In this paper, for the first time, we introduce the concepts of window-CCs and window-SCCs
on undirected and directed temporal graphs, respectively. We then study the queries of …

Querying cohesive subgraphs on temporal graphs with various time constraints has
attracted intensive research interests recently. In this paper, we study a novel Temporal k …

The model of k-core discovers a novel hierarchical structure of a network, which has been
widely applied in various areas, eg, sociology, biology, and brain science. Based on the …

Querying cohesive subgraphs on temporal graphs (eg, social network, finance network, etc.)
with various conditions has attracted intensive research interests recently. In this paper, we …

The real-world entities and their relationships can be modeled using temporal graphs,
where each edge is associated with a timestamp denoting the time of interaction between …

For a temporal graph like transaction network, finding a densely connected subgraph that
contains a vertex like a suspicious account during a period is valuable. Thus, we study the …