k元超立方体的书嵌入

2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI:10.1109/ICADIWT.2008.4664384

S. Bettayeb, D. Hoelzeman

{"title":"k元超立方体的书嵌入","authors":"S. Bettayeb, D. Hoelzeman","doi":"10.1109/ICADIWT.2008.4664384","DOIUrl":null,"url":null,"abstract":"Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Book embedding of the k-ary hypercube\",\"authors\":\"S. Bettayeb, D. Hoelzeman\",\"doi\":\"10.1109/ICADIWT.2008.4664384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.\",\"PeriodicalId\":189871,\"journal\":{\"name\":\"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICADIWT.2008.4664384\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICADIWT.2008.4664384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

图嵌入在互连网络和超大规模集成电路设计中起着重要作用。确定构建VLSI芯片所需的层数只是使用图形嵌入的众多领域之一。一种有助于确定层数的嵌入是书嵌入。我们给出了k元超立方体图书嵌入页数的上界和下界，以及累积页宽的上界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Book embedding of the k-ary hypercube

Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)

自引率

0.00%

发文量