| 超图的可平面性算法 |
| |
| 引用本文： | 程绩.超图的可平面性算法[J].达县师范高等专科学校学报,2007,17(5):13-15. |
| |
| 作者姓名： | 程绩 |
| |
| 作者单位： | 西华师范大学数学与信息学院,四川南充637002 |
| |
| 摘 要： | 随着超图理论在实际问题中的深入应用,其平面性研究也更加具有意义.回顾了超图的一般理论,给出了超图的二部图概念,并在此基础上给出了超图的可平面性算法.该算法是多项式时间算法,是有效算法.
|
| 关 键 词： | 超图 二部图 可平面性 |
| 文章编号： | 1008-4886（2007）05-0013-03 |
| 修稿时间： | 2007-05-29 |
Planarity Algorithm for Hypergraph |
| |
| CHENG Ji.Planarity Algorithm for Hypergraph[J].Journal of Daxian Teachers College,2007,17(5):13-15. |
| |
| Authors: | CHENG Ji |
| |
| Abstract: | Along with thorough application of the hypergraph theory into the actual problem, its planarity research also even more has the significance. This paper firstly reviews the general theory of the hypergraph, and produces the definition bipartite graph of the hypergraph, then based upon this, raises the planarity algorithm, which is the polynomial time algorithm, an effective algorithm. |
| |
| Keywords: | hypergraph bipartite graph planarity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
