Recently, the community search problem has attracted significant attention, due to its wide
spectrum of real-world applications such as event organization, friend recommendation …

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 …

Polarized communities search aims at locating query-dependent communities, in which
mostly nodes within each community form intensive positive connections, while mostly …

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 …

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 …

As a structural indicator of dense subgraphs, k-core has been widely used in community
search due to its concise and efficient calculation. Many community search algorithms have …

Searching for well-connected user communities in a Location-based Social Network (LBSN)
has been extensively investigated. However, very few studies focus on finding a group of …

Attributed graphs are graphs, where the vertices have attributes. Such graphs encompass,
eg, social network graph, citation graphs, and knowledge graphs, which have numerous real …

Community search (CS) is a vital research area in network science that focuses on
discovering personalized communities for query vertices from graphs. However, existing CS …

As an important fundamental task of numerous real-world applications such as social
network analysis and online advertising/marketing, several prior works studied influential …