Efficient Primal-Dual Graph Algorithms for MapReduce-Reference-Cited by-同舟云学术

Efficient Primal-Dual Graph Algorithms for MapReduce

Published:2014 Issue: Volume: Page:59-78
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bahmani Bahman,Goel Ashish,Munagala Kamesh

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-13123-8_6

Reference17 articles.

1. Afrati, F.N., Das Sarma, S., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a map-reduce computation. PVLDB 6, 277–288 (2013)

2. Lecture Notes in Computer Science;KJ Ahn,2011

3. Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta algorithm and applications. Theory of Computing 8, 121–164 (2012)

4. Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: SODA, pp. 949–957 (2007)

5. Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454–465 (2012)

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

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

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

3. Scalable Algorithms for Densest Subgraph Discovery;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

4. Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks;Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2022-08-14