期刊文献+

波兰表达式构成图及顶点数的探讨

Polish expressions graph and its vertices
下载PDF
导出
摘要 基于Wong波兰表达式的理论,引入图论的方法来研究版图设计.构造以波兰表达式为顶点的图,并建立树与Dyck path的一一对应最终计算出此图的顶点个数. 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.
作者 李萃萃
出处 《韶关学院学报》 2010年第12期11-13,共3页 Journal of Shaoguan University
关键词 版图设计 波兰表达式 Dyckpath 顶点 floorplanning polish expression Dyck path vertices
  • 相关文献

参考文献7

  • 1Jepsen D,Gelatt C.Macro placements by Monte Carlo annealing[J].Proc.ICCAD,1983,3:495-498.
  • 2Otten R.Layout structtures[J].Proc.1st IEEE Large Scale Systems Symposium,1982,1(1):96-99.
  • 3Otten R.Efficient floorplan optimizafion[J].Proc.ICCD,1983,57(2):499-502.
  • 4Wong D F,Liu C L.A new algorithm forfloorplan design[J].Proc.23rd ACM/IEEE Design Automation Conf.,1986,23(2):101-107.
  • 5Sadiq M S,Habib Y.VLSI Physical Design Automation:Theory and Practice[M].Singapore:Wodd Scientific.2006:91-114.
  • 6Deutach E.Dyck path enumeration[J].Discrete Mathematics.1999.204(1):167-202.
  • 7斯坦利.计数组合学[M].英文版.北京:机械工业出版社.2004:33-34.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部