On the study of n-ary directed graph
碩士 === 國立交通大學 === 資訊工程研究所 === 82 === In this thesis, we describe a cryptosystem based on n-ary directed graphs. In order to implement this cryptosystem, we discuss some properties of an n-ary directed graph. First of all, we discuss the min...
Main Authors: | Ben Wu Chang, 張本五 |
---|---|
Other Authors: | Yi Shiung Yeh |
Format: | Others |
Language: | en_US |
Published: |
1994
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43366547365316041303 |
Similar Items
Similar Items
-
A Cryptosystem Based on N-ary Cycle Graphs
by: Chen,Yi Chen, et al.
Published: (1993) -
Generalizing association rules in n-ary relations : application to dynamic graph analysis
by: Nguyen, Thi Kim Ngan
Published: (2012) -
Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree
by: Tran Minh Bao, et al.
Published: (2016-02-01) -
Generalizing association rules in n-ary relations : application to dynamic graph analysis
by: Nguyen, Thi Kim Ngan
Published: (2012) -
The Conditional Connectivity of K-ary N-cube Networks
by: Ying-HsuanChang, et al.
Published: (2011)