Pages that link to "Item:Q1223124"
From MaRDI portal
The following pages link to The NP-completeness of the bandwidth minimization problem (Q1223124):
Displayed 5 items.
- Bandwidth of chain graphs (Q293476) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)