DeepAI AI Chat
Log In Sign Up

K-Core Maximization through Edge Additions

by   Zhongxin Zhou, et al.
Zhejiang Gongshang University

A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In this paper, we study the edge k-core problem: Given a graph G, an integer k and a budget b, add b edges to non-adjacent vertex pairs in G such that the k-core is maximized. We prove the problem is NP-hard and APX-hard. A heuristic algorithm is proposed on general graphs with effective optimization techniques. Comprehensive experiments on 9 real-life datasets demonstrate the effectiveness and the efficiency of our proposed methods.


page 1

page 2

page 3

page 4


Building large k-cores from sparse graphs

A popular model to measure network stability is the k-core, that is the ...

A Parameterized Complexity View on Collapsing k-Cores

We study the NP-hard graph problem Collapsed k-Core where, given an undi...

K-Core Minimization: A Game Theoretic Approach

K-cores are maximal induced subgraphs where all vertices have degree at ...

Targeted k-node Collapse Problem: Towards Understanding the Robustness of Local k-core Structure

The concept of k-core, which indicates the largest induced subgraph wher...

Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank

Existing temporal community search suffers from two defects: (i) they ig...

Probabilistic Clustering Using Maximal Matrix Norm Couplings

In this paper, we present a local information theoretic approach to expl...

Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs

We propose a novel cohesive subgraph model called τ-strengthened (α,β)-c...