| 有向超图的可平面性算法 |
| |
| 引用本文： | 程绩.有向超图的可平面性算法[J].西华师范大学学报(哲学社会科学版),2007,28(3):242-245. |
| |
| 作者姓名： | 程绩 |
| |
| 作者单位： | 西华师范大学数学与信息学院,四川南充637002 |
| |
| 基金项目： | 西华师范大学青年教师科研启动基金资助项目（06B034） |
| |
| 摘 要： | 随着有向超图理论在实际问题中的深入应用，其平面性研究也更加具有意义．本文回顾有向超图的一般理论，给出了有向超图结构图的概念，并在此基础上给出有向超图的可平面性算法．由于有向超图的结构图是简单有向图，故有向超图的可平面性算法建立在对一般图的可平面性判断上，该算法是多项式时间算法，是有效算法．
|
| 关 键 词： | 有向超图 结构图 可平面性 |
| 文章编号： | 1673-5072（2007）03-0242-04 |
| 修稿时间： | 2007-05-10 |
Planarity Algorithm for Directed Hypergraph |
| |
| CHENG Ji.Planarity Algorithm for Directed Hypergraph[J].Journal of China West Normal University:Natural Science Edition,2007,28(3):242-245. |
| |
| Authors: | CHENG Ji |
| |
| Abstract: | Along with the directed hypergraph theory in the actual problem thorough application, its planarity research also even more has the significance. This paper first reviews the general theory of the directed hypergraph and has produced structure digraph definition of the directed hypergraph, produced the directed hypergraph in this foundation to be planarity algorithm. This algorithm is the polynomial time algorithm and the effective algorithm. |
| |
| Keywords: | directed hypergraph structure digraph planarity |
| 本文献已被 维普 等数据库收录！ |
