The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

The k-core of a graph is defined as the maximal subgraph in which every vertex is
connected to at least k other vertices within that subgraph. In this work we introduce a …

The adversarial attack methods based on gradient information can adequately find the
perturbations, that is, the combinations of rewired links, thereby reducing the effectiveness of …

Search engines must accurately predict the implicit intent of users to effectively guide their
online search experience and assist them in completing their tasks. Users create time …

The organisation of a network in a maximal set of nodes having at least k neighbours within
the set, known as k-core decomposition, has been used for studying various phenomena. It …

Core maintenance for dynamic hypergraphs has been receiving an increasing attention.
However, existing works mainly focus on the insertion/deletion of hyperedges. This article …

Graph anomaly detection aims to identify anomalous occurrences in networks. However, this
is more challenging than the traditional anomaly detection problem because anomalies in …

Analyzing the structure of real-world networks has attracted much attention over years and
cohesive subgraph models are commonly used to characterize the structure of a network …

Retrieving cohesive subgraphs in networks is a fundamental problem in social network
analysis and graph data management. These subgraphs can be used for marketing …

Cohesive subgraph discovery in a network is one of the fundamental problems and
investigated for several decades. In this paper, we propose the Overlap** Cohesive …