Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. Length-bounded cuts and flows;Baier;ACM Trans. Algorithms (TALG),2010
2. The Complexity of Finding Most Vital Arcs and Nodes;Bar-Noy,1998
3. A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths;Bazgan;Networks,2019
4. The most vital nodes with respect to independent set and vertex cover;Bazgan;Discrete Appl. Math.,2011
5. Length-bounded cuts: Proper interval graphs and structural parameters;Bentert,2019
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献