scientific article
From MaRDI portal
Publication:2721963
zbMath0966.68513MaRDI QIDQ2721963
No author found.
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (14)
Faster Exact Bandwidth ⋮ Approximating the bandwidth of caterpillars ⋮ An exponential time 2-approximation algorithm for bandwidth ⋮ Hardness results for approximating the bandwidth ⋮ Bandwidth and distortion revisited ⋮ Interval degree and bandwidth of a graph ⋮ Capacitated domination faster than \(O(2^n)\) ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ An exact algorithm for minimum distortion embedding ⋮ Exact and approximate bandwidth ⋮ A Subexponential Parameterized Algorithm for Proper Interval Completion ⋮ An Exponential Time 2-Approximation Algorithm for Bandwidth ⋮ Bandwidth of bipartite permutation graphs in polynomial time
This page was built for publication:
