@article{oai:kitami-it.repo.nii.ac.jp:00006509,
 author = {奈良, 宏一 and 山城, 迪},
 issue = {2},
 journal = {北見工業大学研究報告},
 month = {Mar},
 note = {application/pdf, In this paper, the authors deal with two algorithms concerned with graph theory. One of them is an algorithm to find all the elements which can be included in the loops containing designated elements using a fundamental loop matrix. The other is an algorithm to find the minimal number of paths which is necessary in order to construct every possible pattern connecting one node to the other. These patterns consist of all the combinations of paths which connect one node to the other without flowers Algorithms mentioned above are utilized for removing the over-load in a power system's automatic operation. A simple example is given of the application of these algorithms to removing the over-load in a power system.},
 pages = {173--180},
 title = {過負荷解消可能経路選択アルゴリズム*},
 volume = {12},
 year = {1981}
}