Author:
Ogorodnikov Yuri,Rudakov Roman,Khachai Daniil,Khachay Michael
Reference26 articles.
1. New formulations for the elementary shortest-path problem visiting a given set of nodes;Andrade;European Journal of Operational Research,2016
2. Björklund, A. and Husfeldt, T. (2014). Shortest two disjoint paths in polynomial time. In J. Esparza, P. Fraigni-aud, T. Husfeldt, and E. Koutsoupias (eds.), Automata, Languages, and Programming, 211–222. Springer Berlin Heidelberg, Berlin, Heidelberg.
3. A survey of resilience differentiation frameworks in communication networks;Cholda;Communications Surveys & Tutorials, IEEE,,2008
4. Quality of resilience as a network reliability characterization tool;Cholda;IEEE Network,2009
5. Shortest k-disjoint paths via determinants;Datta,2018
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献