Decomposition Theorem with Extended 'cons' Function on Network Topology

スポンサーリンク

概要

• 論文の詳細を見る

• An elementary decomposition theorem in topological network analysis is shown firstly with a brief description of basic concepts of a graph and LISP. According to the theorem an algorithm is given, which extracts all the possible trees and 2-trees from a graph without trial and error. Secondly, a graph as a symbolic expression is described, which is the basis of the function T(G) with extended 'cons'. Lastly, an idea of constructing the function T(G) as a symbolic expression is proposed, which guarantees high efficiency.

• 明治大学の論文

著者

• Mishima Taketoshi

  明治大学

• OHTAKE Masamitsu

  明治大学

• MANOME Yoichi

  明治大学

関連論文

• A Consideration on Data Structures of a Linear Graph
• Decomposition Theorem with Extended 'cons' Function on Network Topology
• An Extension of a Logical Inverse Matrix

スポンサーリンク