Pages that link to "Item:Q3979607"

The following pages link to Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607):

Displayed 9 items.

• Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) ‎ (← links)
• Graph bandwidth of weighted caterpillars (Q860873) ‎ (← links)
• Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) ‎ (← links)
• Embedding ladders and caterpillars into the hypercube (Q1392524) ‎ (← 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)
• Approximating the bandwidth of caterpillars (Q2391175) ‎ (← links)
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) ‎ (← links)