期刊文献+

图的双极定向的一种新算法

An Algorithm for Bipolar Orientations of Graph
下载PDF
导出
摘要 基于刘彦佩教授的吸收规则,构造了一个计算双极定向的线性算法.并证明了该算法是简单易行的. Bipolar orientation have a wide range of applications in VLSI design and also is the basis for many graph drawing algorithms. In this paper we give a linear algorithm to compute bipolar orientation, this algorithm is based on the absorption rule presented by Professor Liu Yanpei. We analyzed the fundamental circuit of the undirected graph, and find out two basic configurations of the circuit. By the optimization of these two configurations, the algorithm of the bipolar orientation is given.
出处 《沈阳师范大学学报(自然科学版)》 CAS 2009年第1期20-23,共4页 Journal of Shenyang Normal University:Natural Science Edition
关键词 双极定向 双极标数 吸收规则 bipolar orientation st-numbering absorption rule
  • 相关文献

参考文献7

  • 1刘彦佩.纵横布局论[M].北京:中国铁道出版社,1996.
  • 2BATTISTA G D, EADES P, TAMASSIA R, et al. Graph Drawing: Algorithms for the Visualization of Graphs[M]. Prentice Hall, 1999.
  • 3TAMASSIA R, TOLLIS I G. A unified approach to visibility representations of planar graphs [ J ]. Discrete and Computational Geometry, 1986,1 (4) :321-341.
  • 4MAON Y, SCHIEBER B, VISHKIN U. Parallel ear decomposition search (EDS) and st-numbering in graphs[J]. Theoret Cornput Sci, 1986,47(3):277-298.
  • 5PAPAKOSTAS A, TOLLIS I G. Algorithms for area-efficient orthogonal drawings [J ]. Computational Geometry: Theory and Applications, 1998,9 ( 1/2) :83-110.
  • 6朱子龙,刘彦佩.两类图的亏格分布[J].沈阳师范大学学报(自然科学版),2006,24(1):1-5. 被引量:5
  • 7姜伟,刘彦佩.几类4-正则平面图的最小折数纵横扩张[J].沈阳师范大学学报(自然科学版),2007,25(2):129-134. 被引量:7

二级参考文献9

  • 1BONDYJA MURTYUSR.图论及其应用[M].北京:科技出版社,1984..
  • 2刘彦佩.Embeddalnlity in Graphs[M].Kluwer Boston,1995.
  • 3FURST M L, GROSS J L, STATMANt R. Genus Distributions for two Classes of Graphs[J]. J Combinatorial Theory, 1989, (17) : 218 - 233.
  • 4GROSS J L, FRUST M L. Hierarchy for Imbedding Distribution Invariants of a Graph[J]. J Graph Theory, 1987,(11) :205 - 220.
  • 5GROSS J L,TUCKER T W. Topological Graph Theory[M]. New York:Wiley-Interscience, 1987.
  • 6刘彦佩.纵横布局论[M].北京:中国铁道出版社,1997.
  • 7WAN Liang-xia, LIU Yan-pei. Minimum bend number for certain planar graphs[J]. Journal of Changde Teachers University: NS, 2001,13(3) :24-30.
  • 8傅超,刘彦佩.一类4-正则图的最小折数纵横扩张[J].曲阜师范大学学报(自然科学版),2002,28(2):16-20. 被引量:6
  • 9万良霞,刘彦佩.纵横扩张的优化[J].高校应用数学学报(A辑),2003,18(3):350-356. 被引量:5

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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