期刊文献+

平面图书式嵌入综述

A Survey on Book-embedding of Planar Graphs
原文传递
导出
摘要 图书式嵌入问题主要起源于大型集成电路(VLSI)设计和多层线路板印刷(PCBs)设计等诸多领域,有广泛的应用价值.图的书式嵌入是将图的点集排在一条直线上(书脊)且将边嵌入到以书脊为边界的半平面上(页)使得同页中的边互不相交.其研究的一个重要参数是页数(满足条件所需的最小页数),该问题是NP-困难的.本文主要综述平面图书式嵌入问题的相关研究. The book-embedding problem arises in several area,such as very large scale integration(VLSI) design and routing multilayer printed circuit boards(PCBs).It can be used into various practical application fields.A book embedding of a graph G is an embedding of its vertices along the spine of a book,and an embedding of its edges to the pages such that edges embedded on the same page do not intersect.The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G.It is an important measure of the quality for book-embedding.It is NP-hard to research the pagenumber of book-embedding for a graph G.This paper summarizes the studies on the book-embedding of planar graphs in recent years.
作者 关夏夏 吴楚雄 杨卫华 孟吉翔 GUAN Xiaxia;WU Chuxiong;YANG Weihua;MENG Jixiang(College of Mathematics,Taiyuan University of Technology,Taiyuan,Shanxi,030024,P.R.China;College of Mathematics and System Science,Xinjiang University,Urumqi,Xinjiang,830046,P.R.China)
出处 《数学进展》 CSCD 北大核心 2020年第1期1-12,共12页 Advances in Mathematics(China)
基金 国家自然科学基金(No.11671296).
关键词 书式嵌入 平面图 页数 book embedding planar graphs pagenumber
  • 相关文献

参考文献3

二级参考文献32

  • 1OLLMANN L T. On the book thicknesses of various graphs [ C]//Proc. 4th southeastern conference on combinatorics, Graphtheory and computing, Congressus Numerantium, Winnipeg: Utilitas Mathematics Publ. Inc.,1973. VIII 459.
  • 2CHUNG F R K, LEIGHTON F T,ROSENBERG A L. Embedding graph in books: a layout problem with applications to VLSI.design [J]. SIAM J Alg Disc Math, 1987,8( 1) :33-58.
  • 3SHAHROKHI F, SHI W. On crossing sets, disjiont sets and pagenumber [J]. J Algor, 2000,34(1) :40-53.
  • 4BEMHART F, KAINEN B. The book thickness of a graph [ J]. J Comb Theory B, 1979,27(3) :320-331.
  • 5BONDY J A, MURTY U S R. Graph theory with application [ M]. Berlin:Springer, 2008.
  • 6HEATH L S,LEIGHTON F T,ROSENBERG A L. Compariting queues and stacks as mechanisms for laying out graphs [ J ].SIAM J Discrete Math, 1992,5(3) :398-412.
  • 7ROSENBERG A L. The diogenes approach to testable fault-tolerant arrays of processors [ J]. IEEE Trans Comput, 1983 ,32(10):902-910.
  • 8TARJAN R E. Sorting using networks of queues and stacks [J]. J Appl Comput Math, 1972,19(2) :341-346.
  • 9KAPPOOR N, RUSSELL M, STOJMENOVIC I,et aL A genetic algorithm for finding the pagenumber of interconnection net-works [J]. J Parallel Distr Com, 2002,62(2) :267-283.
  • 10YANNAKAKIS M. Embedding planar graph in four pages [J]. J Comput Syst Sci, 1989,38( 1 ) :36-37.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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