扩展图的布局

Chic. J. Theor. Comput. Sci. Pub Date : 2015-01-20 DOI:10.4086/CJTCS.2016.001

V. Dujmovic, Anastasios Sidiropoulos, D. Wood

{"title":"扩展图的布局","authors":"V. Dujmovic, Anastasios Sidiropoulos, D. Wood","doi":"10.4086/CJTCS.2016.001","DOIUrl":null,"url":null,"abstract":"Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.","PeriodicalId":202345,"journal":{"name":"Chic. J. Theor. Comput. Sci.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Layouts of Expander Graphs\",\"authors\":\"V. Dujmovic, Anastasios Sidiropoulos, D. Wood\",\"doi\":\"10.4086/CJTCS.2016.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.\",\"PeriodicalId\":202345,\"journal\":{\"name\":\"Chic. J. Theor. Comput. Sci.\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chic. J. Theor. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4086/CJTCS.2016.001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chic. J. Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4086/CJTCS.2016.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

Bourgain和Yehudayoff最近构造了$O(1)$-单调二部展开式。将这一结果与Kannan展开方法的推广相结合，构造了最佳可能的3-单调二部展开器。然后我们证明了相同的图允许3页的书籍嵌入，2队列布局，4轨道布局，并且具有简单的厚度2。所有这些结果都是最好的。

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

查看原文本刊更多论文

Layouts of Expander Graphs

Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.

求助全文

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

来源期刊

Chic. J. Theor. Comput. Sci.

自引率

0.00%

发文量