Studies on the design of algorithms for reliable networks and its application

在现代社会中，我们有许多网络，如交通网络和通信网络。这就要求这种网络具有一定的容错性。图的连通性概念被认为是网络容错性的一种度量。在这项研究中，我们提出了几个有效的算法，连接增强问题和源定位问题，这是众所周知的图问题的连接。同时，我们推广了这些结果，这可能有助于其他问题的分析。

In modern society, we have many networks such as traffic networks and communication networks. It is required that such networks have some fault-tolerance. The concepts of graph connectivity are known as one measure of network fault-tolerance. In this research, we proposed several efficient algorithms for connectivity augmentation problems and source location problems, which are well-known as graph problems concerning connectivity. Also, we generalized these results, which may contribute to the analysis of other problems.