記号回路解析に適したすべての木の生成方法
スポンサーリンク
概要
- 論文の詳細を見る
Some properties for the sets of trees in an undirected graph are given. An effective method for finding all possible trees is presented and it is expressed recursively. The labor to find a set of all trees is much reduced, since a graph is defined as a union of parallel branches. In order to treat topological properties on the computer, binary list structure is used to represent a graph, The method can be implemented effectively and esthetically by a computer language LISP. The method is applicable to symbolic network analysis.
- 一般社団法人情報処理学会の論文
- 1973-12-15