Author:
Nagamochi Hiroshi,Ibaraki Toshihide
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference90 articles.
1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
2. Preserving and increasing local edge-connectivity in mixed graphs;Bang-Jensen;SIAM J. Discrete Math.,1995
3. Edge-connectivity augmentation with partition constraints;Bang-Jensen;SIAM J. Discrete Math.,1999
4. Edge-connectivity augmentation preserving simplicity;Bang-Jensen;SIAM J. Discrete Math.,1998
5. A.A. Benczúr, Augmenting undirected connectivity in Õ (n3) time, Proceedings of 26th ACM Symposium on Theory of Computing, 1994, pp. 658–667.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献