Author:
Gupta Rahul Raj,Karmakar Sushanta
Publisher
Springer International Publishing
Reference20 articles.
1. Ausiello, G., Nanni, U., Italiano, G.F.: Dynamic maintenance of directed hypergraphs. Theor. Comput. Sci. 72(2–3), 97–117 (1990)
2. Chekuri, C., Xu, C.: Computing minimum cuts in hypergraphs. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1085–1100. Society for Industrial and Applied Mathematics (2017)
3. Cheng, E.: Edge-augmentation of hypergraphs. Math. Program. 84(3), 443–465 (1999)
4. Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of the system of minimum edge cuts in a graph. In: Investigations in Discrete Optimization, pp. 290–306 (1976) (in Russian)
5. Dinitz, Y., Westbrook, J.: Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica 20(3), 242–276 (1998)