首页 | 本学科首页   官方微博 | 高级检索  
     

基于逆向MVD超图的求MVD最小覆盖算法研究
引用本文:郝忠孝,刘文远.基于逆向MVD超图的求MVD最小覆盖算法研究[J].计算机研究与发展,1994,31(12):11-15.
作者姓名:郝忠孝  刘文远
作者单位:东北重型机械学院
基金项目:黑龙江省自然科学基金,机械工业部予研基金
摘    要:本文详细讨论了逆向MVD超图的性质,给出了伪完全等价准路、完全等价准路、子边等价准路等概念。证明了若干个逆向MVD超图的化简定理,最后给出了基于逆向MVD超图的求MVD最小覆盖算法。

关 键 词:超图  逆向MVD超图  最小覆盖  算法

Research on the Algorithm to Find the Minimum Cover of MVD Based on the Inverse Hypergraph of MVD
Hao Zhongxiao, Liu Wenyuan, and Ding Zhanao.Research on the Algorithm to Find the Minimum Cover of MVD Based on the Inverse Hypergraph of MVD[J].Journal of Computer Research and Development,1994,31(12):11-15.
Authors:Hao Zhongxiao  Liu Wenyuan  and Ding Zhanao
Abstract:This paper discusses the qualities of the inverse hypergraph of MVD in detail and provessome theorems to simply the inverse hypergraph of MVD. The algorithm to find the minimum coverof MVD based on the inverse hypergraph of MVD is given also.
Keywords:inverse hypergraph of MVD  pseudo-complete equivalence quasi-path  sub-edge completeequivalence quasi-path  minimum cover  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号