Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference33 articles.
1. Addis B, Di Summa M, Grosso A. Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl Math, 2013;161:2349–2360
2. Approximability of the firefighter problem;Anshelevich;Algorithmica,2012
3. Anshelevich E, Kempe D. Prophylactic vaccination of networks. In: SODA; 2008.
4. Arora S, Rao S, Vazirani U. Expander flows, geometric embeddings and graph partitioning. In: Proceedings of the 36th annual ACM symposium on theory of computing; 2004. p. 222–231.
5. Expander flows, geometric embeddings and graph partitioning;Arora;J ACM,2009
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献