Author:
Hayrapetyan Ara,Kempe David,Pál Martin,Svitkina Zoya
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
2. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: STOC (2004)
3. Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. Journal of Algorithms, 34 (2000)
4. Bailey, N.: The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, New York (1975)
5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. on Computing 25, 1305–1317 (1996)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding Cuts in Static Analysis Graphs to Debloat Software;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
2. Local Centrality Minimization with Quality Guarantees;Proceedings of the ACM Web Conference 2024;2024-05-13
3. Immunization in the Threshold Model: A Parameterized Complexity Study;Algorithmica;2023-04-07
4. Effective Social Network-Based Allocation of COVID-19 Vaccines;Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2022-08-14
5. A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis;Journal of Global Optimization;2022-06-15