Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
From MaRDI portal
Publication:2963896
DOI10.4230/LIPIcs.FSTTCS.2013.43zbMath1359.68125arXiv1310.2928OpenAlexW1878224396MaRDI QIDQ2963896
No author found.
Publication date: 21 February 2017
Full work available at URL: https://arxiv.org/abs/1310.2928
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (6)
Detours in directed graphs ⋮ Going Far from Degeneracy ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ Unnamed Item ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ Finding Detours is Fixed-Parameter Tractable
This page was built for publication: Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
