Higher-order graph clustering aims to partition the graph using frequently occurring
subgraphs (ie, motifs), instead of the lower-order edges, as the atomic clustering unit, which …

Size-constrained community search, retrieving a size-bounded high-quality subgraph
containing user-specified query vertices, has been extensively studied in graph analysis …

Real-world networks, such as phone-call networks and social networks, are often not static
but temporal. Mining cohesive subgraphs from static graphs is a fundamental task in network …

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 …

Real-world networks, such as social networks, cryptocurrency networks, and e-commerce
networks, always have occurrence time of interactions between nodes. Such networks are …

Community search, retrieving the cohesive subgraph which contains the user-specified
query vertex, has been widely touched over the past decades. The existing studies on …

Abstract The Maximum Satisfiability (MaxSAT), an important optimization problem, has a
range of applications, including network routing, planning and scheduling, and …

The computation of a group Steiner tree (GST) in various types of graph networks, such as
social network and transportation network, is a fundamental graph problem in graphs, with …

Graph representation learning aims to map nodes or edges within a graph using low-
dimensional vectors, while preserving as much topological information as possible. During …

Existing temporal community search suffers from two defects:(i) they ignore the temporal
proximity between the query vertex $ q $ and other vertices but simply require the result to …