Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Talele, Nirupama"'
Motivated by an application in network security, we investigate the following "linear" case of Directed Mutlicut. Let $G$ be a directed graph which includes some distinguished vertices $t_1, \ldots, t_k$. What is the size of the smallest edge cut whi
Externí odkaz:
http://arxiv.org/abs/1407.7498
Publikováno v:
2016 IEEE European Symposium on Security & Privacy (EuroS&P); 2016, p179-194, 16p
Publikováno v:
Engineering Secure Software & Systems 7th International Symposium, ESSoS 2015, Milan, Italy, March 4-6, 2015. Proceedings; 2015, p178-195, 18p
Publikováno v:
Engineering Secure Software & Systems (9783642365621); 2013, p17-32, 16p
Autor:
Muthukumaran, Divya, Rueda, Sandra, Talele, Nirupama, Vijayakumar, Hayawardh, Teutsch, Jason, Jaeger, Trent
Publikováno v:
Proceedings of the 28th Annual Computer Security Applications Conference; 12/3/2012, p269-278, 10p