scientific article
From MaRDI portal
Publication:3549635
zbMath1232.68074MaRDI QIDQ3549635
Pinar Heggernes, Jan Arne Telle, Yngve Villanger, Christophe Paul
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Planar Disjoint-Paths Completion ⋮ Planar disjoint-paths completion ⋮ A Polynomial-Time Algorithm for Outerplanar Diameter Improvement ⋮ A polynomial-time algorithm for outerplanar diameter improvement ⋮ Wheel-Free Deletion Is W[2-Hard] ⋮ Minimum Leaf Out-Branching Problems ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ Fixed-parameter complexity of minimum profile problems ⋮ Chordal deletion is fixed-parameter tractable ⋮ On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems ⋮ Parameterizing above or below guaranteed values ⋮ Minimum leaf out-branching and related problems ⋮ A Probabilistic Approach to Problems Parameterized above or below Tight Bounds ⋮ Unnamed Item
This page was built for publication:
