Layouts of Expander Graphs

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. Key words and phrases: expander graph, monotone layout, book embedding, stack layout, queue layout, track layout, thickness

• Type: Journal
• Year: 2016
• Where: CJTCS
• Authors: Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood
• Keywords: CJTCS 2016, Hardware