摘要: |
证明"图G与图F同构当且仅当它们有相合的VC算法"的结论,对于简单有向图依然成立。 |
关键词: 有向图 同构 VC算法 |
DOI: |
投稿时间:2000-08-04 |
基金项目: |
|
Diraph's Isomorphism |
Luo Shifeng
|
(College of Computer & Information Engineering, Guangxi University, Nanning, 530004) |
Abstract: |
The sufficient and neccessary condition of two digraphs' isomorphism is that they have a coincidental VC algorithm, which is proved. |
Key words: digraph isomorphism VC algorithm |