摘要
While most previous work pays attention on <italic>extracting</italic> dense subgraphs, such as <italic>k</italic>-cores, we argue that augmenting the graph to maximize the size of dense subgraphs is also very important and finds many applications. Therefore, in this article, we study the dense subgraph augmentation problem in multilayer graphs. Specifically, we propose the notion of (<italic>k</italic>, <italic>L</italic>)-core to model the dense subgraphs in multilayer graphs and propose a new research problem, budgeted maximal (<italic>k</italic>, <italic>L</italic>)-core augmentation (BMA) problem, which adds at most <italic>b</italic> edges in the multilayer graphs to maximize the size of (<italic>k</italic>, <italic>L</italic>)-core. We prove the NP-hardness of the general BMA problem when <italic>k</italic> &null 2 and devise a polynomial-time algorithm to find the optimal solution for a special case of BMA, i.e., (2, 1)-BMA. We then devise an effective algorithm, named search for optimum and reorder adaptively (SORA), with various performance-improving strategies to tackle the general BMA problem. We evaluate the performance of the proposed approaches on multiple large-scale datasets and compare them with the state-of-the-art baselines. Experimental results indicate that our proposed approaches significantly outperform the baselines in terms of solution quality and efficiency.