Author:
Bang-Jensen Jørgen,Jordán Tibor
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference21 articles.
1. Preserving and increasing local edge-connectivity in mixed graphs;Bang-Jensen;SIAM J. Discrete Math.,1995
2. Edge-connectivity augmentation with partition constraints;Bang-Jensen;SIAM J. Discrete Math.,1999
3. Edge-connectivity augmentation preserving simplicity;Bang-Jensen;SIAM J. Discrete Math.,1998
4. J. Bang-Jensen, and, T. Jordán, Splitting Off Edges between Two Subsets Preserving the Edge-Connectivity of the Graph, IMADA, SDU, Odense Universitet, Preprints No. 11/2000.
5. The minimum augmentation of any graph to a k-edge-connected graph;Cai;Networks,1989
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献