The following pages link to (Q3839788):
Displaying 6 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
