Recent Development of Graph Connectivity Augmentation Algorithms(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• The connectivity augmentation problem asks to add to a given graph the smallest number of new edges so that the edge-(or vertex-)connectivity of the graph increases up to a specified value k. The problem has been extensively studied, and several efficient algorithm have been discoverd. We survey the recent development of the algorithms for this problem. In particular, we show how the minimum cut algorithm due to Nagamochi and Ibaraki is effectively applied to solve the edge-connectivity augmentation problem.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Nagamochi Hiroshi

  The Graduate School Of Informatics Kyoto University

• Nagamochi H

  Toyohashi Univ. Technol. Toyohashi Jpn

関連論文

• Recent Development of Graph Connectivity Augmentation Algorithms(Special Issue on Algorithm Engineering : Surveys)
• Contention-Free λ-Planes in Optically Burst-Switched WDM Networks(Internet)

スポンサーリンク