Work

Layouts of Expander Graphs

Year: 2015

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1501.05020

Authors: Dujmović, Vida, Sidiropoulos, Anastasios, Wood, David R.

Institutions: University of Ottawa, The Ohio State University, Monash University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2410469020

Cites:

Cited by:

Related to: 20