Pages that link to "Item:Q4542526"
From MaRDI portal
The following pages link to Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q4542526):
Displaying 7 items.
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- On approximation intractability of the path-distance-width problem (Q5936467) (← links)
