Pages that link to "Item:Q1223124"
From MaRDI portal
The following pages link to The NP-completeness of the bandwidth minimization problem (Q1223124):
Displaying 10 items.
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs (Q5321706) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
- Approximating the bandwidth for asteroidal triple-free graphs (Q6102320) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- On the 2-layer window width minimization problem (Q6169525) (← links)
- Bandwidth and profile minimization (Q6199476) (← links)