Graph Bandwidth
Publisher
Springer New York
Reference19 articles.
1. Blum A, Konjevod G, Ravi R, Vempala S (2000) Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor Comput Sci 235(1):25–42, Selected papers in honor of Manuel Blum (Hong Kong, 1998)
2. Bourgain J (1985) On Lipschitz embedding of finitemetric spaces in Hilbert space. Israel J Math 52(1–2):46–52
3. Chinn PZ, Chvátalová J, Dewdney AK, Gibbs NE (1982) The bandwidth problem for graphs and matrices – a survey. J Graph Theory 6(3):223–254
4. Chung FRK, Seymour PD (1989) Graphs withsmall bandwidth and cutwidth. Discret Math 75(1–3):113–119, Graph theory and combinatorics, Cambridge (1988)
5. Dunagan J, Vempala S (2001) On Euclidean embeddings and bandwidth minimization. In: Randomization, approximation, and combinatorial optimization. Springer, pp 229–240