| 两类4-正则图的最小折数纵横扩张 |
| |
| 引用本文： | 俞勤,刘彦佩,杨燕. 两类4-正则图的最小折数纵横扩张[J]. 北京交通大学学报(自然科学版), 2006, 30(6): 77-80,84 |
| |
| 作者姓名： | 俞勤 刘彦佩 杨燕 |
| |
| 作者单位： | 北京交通大学,理学院,北京,100044;北京交通大学,理学院,北京,100044;北京交通大学,理学院,北京,100044 |
| |
| 摘 要： | 纵横嵌入的理论已被用在超大规模集成电路的设计中.确定最小折数扩张已经从理论上得到了有效算法.本文作者在这一理论的基础上,进一步研究了两个特殊的4-正则图类,得到了确定这两类图的最小折数纵横扩张的简便算法,并给出了这两类图的纵横扩张的最小折数.
|
| 关 键 词： | 图论 纵横扩张 最小折数 4-正则图 |
| 文章编号： | 1673-0291（2006）06-0077-04 |
| 收稿时间： | 2005-11-24 |
| 修稿时间： | 2005-11-24 |
Minimum Bend Rectilinear Extensions of Two Kinds of 4-Regular Graphs |
| |
| YU Qin,LIU Yan-pei,YANG Ye. Minimum Bend Rectilinear Extensions of Two Kinds of 4-Regular Graphs[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY, 2006, 30(6): 77-80,84 |
| |
| Authors: | YU Qin LIU Yan-pei YANG Ye |
| |
| Affiliation: | School of Science, Beijing Jiaotong University, Beijing 100044, China |
| |
| Abstract: | The theory of rectilinear embeddings of graphs has been used in the design of VLSI. The determination of minimum bends in a rectilinear extension of a graph has been solved with effective algorithm. Based on this theory, we discuss rectilinear extensions of two particular kinds of 4-regular graphs with the minimum total number of bends in this article, and obtain a simple algorithm as well as the minimum total number of bends. |
| |
| Keywords: | graph theory rectilinear extension bend minimization 4-regular graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
