| 波兰表达式构成图及顶点数的探讨 |
| |
| 引用本文： | 李萃萃. 波兰表达式构成图及顶点数的探讨[J]. 韶关学院学报, 2010, 31(12): 11-13 |
| |
| 作者姓名： | 李萃萃 |
| |
| 作者单位： | 韶关学院数学与信息科学学院,广东韶关512005 |
| |
| 摘 要： | 基于Wong波兰表达式的理论,引入图论的方法来研究版图设计.构造以波兰表达式为顶点的图,并建立树与Dyck path的一一对应最终计算出此图的顶点个数.
|
| 关 键 词： | 版图设计 波兰表达式 Dyckpath 顶点 |
Polish expressions graph and its vertices |
| |
| LI Cui-cui. Polish expressions graph and its vertices[J]. Journal of Shaoguan University(Social Science Edition), 2010, 31(12): 11-13 |
| |
| Authors: | LI Cui-cui |
| |
| Affiliation: | LI Cui-cui (College of Mathematics and Information Science,Shaoguan University,Shaoguan 512005,Guangdong,China) |
| |
| Abstract: | Based on Wong＇s theory of polish expressions,we introduced graph theory for the floorplanning problem.In this paper,we will mainly investigate the normalized polish expressions.Let G be a graph,in which normalized polish expressions are viewed as viewed as the vertices.We establish a one-to-correspondence between tree and Dyck Path,and discuss the number of vertices of the graph in this paper. |
| |
| Keywords: | floorplanning polish expression Dyck path vertices |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
