In social networks, the leave of critical users may significantly break network engagement,
ie, lead a large number of other users to drop out. A popular model to measure social …

In this paper, we study the problem of the anchored k-core. Given a graph G, an integer k
and a budget b, we aim to identify b vertices in G so that we can determine the largest …

In social networks, dense relationships among users contribute to stable communities.
Breakdowns of critical connections may cause users to leave the group. A popular model to …

As one of the most representative cohesive subgraph models, k-core model has recently
received significant attention in the literature. In this paper, we investigate the problem of the …

Core maximization, that enlarges the k-core as much as possible by inserting a few new
edges into a graph, is particularly useful for social group engagement and network stability …

Hypergraphs are a powerful abstraction for modeling high-order relations, which are
ubiquitous in many fields. A hypergraph consists of nodes and hyperedges (ie, subsets of …

In social network (SN), a node is considered as a social entity and a link defines the
connection between social entities. In general, the link is shown as a dyadic relationship …

In this paper, we study the problem of the anchored k-core. Given a graph G, an integer k
and a budget b, we aim to identify b vertices in G so that we can determine the largest …

In social network (SN), a node is considered as a social entity and a link defines the
connection between social entities. In general, the link is shown as a dyadic relationship …

Graphs are widely used to model relationships in various applications, such as social
science, biology, information technology, to name a few. Mining cohesive subgraphs is one …