A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-ANo. 5 ;
pp. 1263-1268 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, connectivity augmentation, edge-connectivity, edge-splitting, extreme vertex sets, graph,