Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

43

CJTCS
2016

favoriteEmaildiscussreport

71views Hardware» more CJTCS 2016»

Layouts of Expander Graphs

8 years 20 days ago

Layouts of Expander Graphs

Download cjtcs.cs.uchicago.edu

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

Vida Dujmovic, Anastasios Sidiropoulos, David R. W

Real-time Traffic

CJTCS 2016 | Hardware |

claim paper

Related Content

» Practicable Layouts for Optimal Circulant Graphs

» H3 laying out large directed graphs in 3D hyperbolic space

» Topology Preserving Constrained Graph Layout

» Constrained Graph Layout

» Noise Tolerance of Expanders and Sublinear Expander Reconstruction

» Dynamic Spectral Layout of Small Worlds

» Testing Hereditary Properties of NonExpanding BoundedDegree Graphs

» Dunnart A ConstraintBased Network Diagram Authoring Tool

» Applying Graphical Design Techniques to Graph Visualisation

» Dynamic Spectral Layout with an Application to Small Worlds

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CJTCS
Authors	Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood

Comments (0)