scientific article
From MaRDI portal
Publication:3396557
zbMath1169.68446MaRDI QIDQ3396557
Dimitrios M. Thilikos, Maria J. Serna
Publication date: 19 September 2009
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 (11)
The mixed page number of graphs ⋮ The Rique-number of graphs ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Confronting intractability via parameters ⋮ Graph parameters measuring neighbourhoods in graphs-bounds and applications ⋮ Fixed-parameter complexity of minimum profile problems ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Linear layouts measuring neighbourhoods in graphs ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ Parameterized algorithmics for linear arrangement problems ⋮ Derivation of algorithms for cutwidth and related graph layout parameters
This page was built for publication:
