Greedy Approximation Algorithms for Finding Dense Components in a Graph-Reference-Cited by-同舟云学术

Greedy Approximation Algorithms for Finding Dense Components in a Graph

Published:2000 Issue: Volume: Page:84-95
ISSN:0302-9743
Container-title:Approximation Algorithms for Combinatorial Optimization
language:
Short-container-title:

Author:

Charikar Moses

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44436-X_10

Reference13 articles.

1. Lect Notes Comput Sci;Y. Asahiro,1995

2. Y. Asahiro, K. Iwama, H. Tamaki and T. Tokuyama. Greedily Finding a Dense Subgraph. Journal of Algorithms, 34(2):203–221 (2000).

3. P. Drineas, A. Frieze, R. Kannan, S. Vempala and V. Vinay. Clustering in Large Graphs and Matrices. Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 291–299 (1999).

4. U. Feige, G. Kortsarz and D. Peleg. The Dense k-Subgraph Problem. Algorithmica, to appear. Preliminary version in Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, 692–701 (1993).

5. U. Feige and M. Seltser. On the Densest k-Subgraph Problem. Weizmann Institute Technical Report CS 97-16 (1997).

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

1. FiFrauD: Unsupervised Financial Fraud Detection in Dynamic Graph Streams;ACM Transactions on Knowledge Discovery from Data;2024-01-27

2. Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs;ACM Transactions on Knowledge Discovery from Data;2024-01-02

3. On Directed Densest Subgraph Detection;Lecture Notes in Computer Science;2023-11-07

4. Discovering Densest Subgraph over Heterogeneous Information Networks;Lecture Notes in Computer Science;2023-11-07

5. Densest Periodic Subgraph Mining on Large Temporal Graphs;IEEE Transactions on Knowledge and Data Engineering;2023-11-01