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,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/04/01 Vol. E88-ANo. 4 ;
pp. 954-963 Type of Manuscript: Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: graphs, connectivity augmentation, vertex-connectivity, degree constraints, linear time algorithms,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/03/01 Vol. E84-ANo. 3 ;
pp. 781-793 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: graph, connectivity augmentation, vertex-connectivity, degree-unchangeable vertices, polynomial time algorithms,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/04/25 Vol. E76-ANo. 4 ;
pp. 518-531 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: linear-time algorithms, 3-edge-connected graphs, connectivity augmentation, computational complexity,