scientific article
From MaRDI portal
Publication:2766686
zbMath0988.68125MaRDI QIDQ2766686
Ton Kloks, Haiko Müller, Dieter Kratsch, Yvan Le Borgne
Publication date: 9 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs ⋮ Hardness results for approximating the bandwidth ⋮ Cubicity and bandwidth ⋮ Mixed Search Number and Linear-Width of Interval and Split Graphs ⋮ Bandwidth on AT-free graphs ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Hardness and approximation of minimum distortion embeddings ⋮ On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
This page was built for publication: