Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/02/01 Vol. E89-DNo. 2 ;
pp. 744-750 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Graph Algorithm Keyword: algorithm, edge-connectivity, extreme vertex sets, graph, source location problem,