How to Use
Select graph:
- sk: Skewness
- =0?: Planar?
- vs cr: Compare
Bounds
sk ≥ m - (3n-6) (planarity bound). sk ≤ m - n + 1 (spanning tree). K_5: sk=1with only 1 edge removal. K_{3,3}: sk=1. K_n: sk = n(n-1)/2 - (3n-6) for n≥3.
Applications
VLSI layout: minimize wire crossings. Network design: make networks planar for routing. Graph drawing: simplify by removing few edges. Algorithm design: near-planar graph algorithms.
Step-by-Step Instructions
- 1Select graph.
- 2Compute skewness.
- 3Check planarity.
- 4Apply lower bound.
- 5Compare with cr.