The following pages link to (Q4952701):
Displaying 10 items.
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Improved bandwidth approximation for trees and chordal graphs (Q2746436) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Approximating the bandwidth via volume respecting embeddings (extended abstract) (Q4542524) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479359) (← links)
