How to Use
Select graph:
- bt: Book thickness
- Pages: Edge assignment
- Spine: Vertex order
Planar Graphs
Every planar graph has bt ≤ 4 (Yannakakis, 1989). Some planar graphs need 4 pages. Outerplanar: bt=1 (edges form a non-crossing set). Series-parallel: bt ≤ 2. Halin graphs: bt = 2.
Applications
VLSI layout: stack layout of circuits. Fault-tolerant computing: data layout. Compiler optimization: register allocation. Computational geometry: point visibility. Book embeddings model linear data structures.
Step-by-Step Instructions
- 1Select graph.
- 2Compute bt(G).
- 3Find spine order.
- 4Assign pages.
- 5Verify no crossings.