Author:
Nagamochi Hiroshi,Nakao Yoshitaka,Ibaraki Toshihide
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference19 articles.
1. A.A. Benczúr, Augmenting undirected connectivity in RNC and in randomized Ō(n3) time. Proc. 26th ACM Symposium on Theory of Computing, 1994, 658–667.
2. E.A. Dinits, A.V. Karzanov and M.V. Lomonosov, On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization (in Russian) (ed. A.A. Fridman), Nauka, Moscow, 1976, 290–306.
3. L. Fleischer, Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. Lecture Notes in Computer Science,1412, Springer-Verlag, 6th Conference on Integer Programming and Combinatorial Optimization, Houston, June 22–24, 1998, 294–309.
4. L.R. Ford and D.R. Fulkerson, Flows in Networks. Princeton University Press, Princeton, N. J., 1962.
5. H.N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity. Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, 812–821.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献