Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: K-Core Maximization through Edge Additions   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.

29
The categories of this paper are: funct-an
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas