scientific article; zbMATH DE number 1833416
From MaRDI portal
Publication:4780797
zbMath1001.05045MaRDI QIDQ4780797
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290229
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Approximating the bandwidth of caterpillars ⋮ Flow metrics ⋮ Lower bounds for the bandwidth problem ⋮ An exponential time 2-approximation algorithm for bandwidth ⋮ Hardness results for approximating the bandwidth ⋮ Interval degree and bandwidth of a graph ⋮ Volume in general metric spaces ⋮ Exact and approximate bandwidth ⋮ Volume distortion for subsets of Euclidean spaces ⋮ Retracting Graphs to Cycles ⋮ An Exponential Time 2-Approximation Algorithm for Bandwidth ⋮ Efficient algorithms for online decision problems
