How to Use
Select graph:
- bw_t: Topological bw
- bw: Compare with bw
- Δ: Max degree
Tree Formula
For trees: bw_t(T) = ⌈(Δ(T)+1)/2⌉. Beautiful closed form! Depends only on max degree. For general graphs: NP-hard. Subdivision 'amortizes' high-bandwidth edges by spreading them out.
Theory
bw_t relates bandwidth to topological properties. Adding subdivisions smooths out edge congestion. Connection to cutwidth: cw(G) ≥ bw_t(G). For planar graphs: bw_t = O(√n). Deep structural relationships.
Step-by-Step Instructions
- 1Select graph.
- 2Compute bw.
- 3Subdivide edges.
- 4Minimize bw.
- 5Compare bw_t vs bw.