Author:
Barbosa Fábio,Agra Agostinho,de Sousa Amaro
Publisher
Springer International Publishing
Reference12 articles.
1. Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. C&OR 36, 2193–2200 (2009)
2. Veremyev, A., Boginski, V., Pasiliao, E.: Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8, 1245–1259 (2014)
3. Di Summa, M., Grosso, A., Locatelli, M.: Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3), 649–680 (2012)
4. Santos, D., de Sousa, A., Monteiro, P.: Compact models for critical node detection in telecommunication networks. Electron. Notes Discret. Math. 64, 325–334 (2018)
5. Veremyev, A., Prokopyev, O., Pasiliao, E.: Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3), 170–195 (2015)