Finding connected k -subgraphs with high density-Reference-Cited by-同舟云学术

Finding connected k -subgraphs with high density

Published:2017-10 Issue: Volume:256 Page:160-173
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Chen Xujin,Hu Xiaodong,Wang Changjun

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference30 articles.

1. Noga Alon, Sanjeev Arora, Rajsekar Manokaran, Dana Moshkovitz, Omri Weinstein, Inapproximability of densest k-subgraph from average case hardness, Manuscript, 2011.

2. Finding dense subgraphs with size bounds;Andersen,2009

3. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora,1995

4. Finding dense subgraphs;Asahiro,1995

5. Greedily finding a dense subgraph;Asahiro;J. Algorithms,2000

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs;Applied Mathematics and Computation;2024-02

2. A memetic algorithm for finding multiple subgraphs that optimally cover an input network;PLOS ONE;2023-01-20

3. On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees;Information and Computation;2022-11

4. Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph;Theoretical Computer Science;2021-01

5. Robustness-oriented k Edge Server Placement;2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID);2020-05