Greedily Finding a Dense Subgraph-Reference-Cited by-同舟云学术

Greedily Finding a Dense Subgraph

Published:2000-02 Issue:2 Volume:34 Page:203-221
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Asahiro Yuichi,Iwama Kazuo,Tamaki Hisao,Tokuyama Takeshi

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference9 articles.

1. Finding dense subgraphs;Asahiro,1995

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

3. U. Feige, and, M. Seltser, On the Densest k-Subgraph Problem, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehobot, 1997.

4. Combinatorial optimization: A survey;Grötschel,1995

5. Generating sparse 2-spanners;Kortsarz;J. Algorithms,1994

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

1. Dense Subgraph Discovery Meets Strong Triadic Closure;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Finding Densest Subgraphs with Edge-Color Constraints;Proceedings of the ACM Web Conference 2024;2024-05-13

3. Efficient and effective algorithms for densest subgraph discovery and maintenance;The VLDB Journal;2024-05-08

4. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30

5. Cardinality-Constrained Binary Quadratic Optimization via Extreme Point Pursuit, with Application to the Densest K-Subgraph Problem;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14