1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)
2. Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Operations Research Letters 8, 73–76 (1989)
3. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes, University of Maryland, Institute of Anvanced Computer Studies, College Park, MD, Technical Report CS-TR-3539 (1995)
4. Beffara, E., Vorobyov, S.: Adapting Gurvich-Karzanov-Khachiyan’s algorithm for parity games: Implementation and experimentation, Technical Report 020, Department of Information Technology, Uppsala University (2001), Available at: https://www.it.uu.se/research/reports/#2001
5. Beffara, E., Vorobyov, S.: Is randomized Gurvich-Karzanov-Khachiyan’s algorithm for parity games polynomial? Technical Report 025, Department of Information Technology, Uppsala University (2001), Available at: https://www.it.uu.se/research/reports/#2001