scientific article
From MaRDI portal
zbMath0903.05042MaRDI QIDQ3839788
Publication date: 10 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An exponential time 2-approximation algorithm for bandwidth, Bandwidth on AT-free graphs, A note on maximum differential coloring of planar graphs, Hardness and approximation of minimum distortion embeddings, Bandwidth of Bipartite Permutation Graphs in Polynomial Time, Bandwidth of bipartite permutation graphs in polynomial time