scientific article; zbMATH DE number 6857816

DOI10.4230/LIPIcs.IPEC.2016.20zbMath1398.68251arXiv1610.04711MaRDI QIDQ4634403

Daniel Lokshtanov, Mithilesh Kumar

Publication date: 10 April 2018

Full work available at URL: https://arxiv.org/abs/1610.04711

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

kernelparameterized algorithmscomponent order connectivityweighted expansionmax-min allocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Linear kernels for separating a graph into components of bounded size ⋮ Component order connectivity in directed graphs ⋮ Parameterized Complexity of Safe Set ⋮ Component order connectivity in directed graphs ⋮ Parameterized algorithms for generalizations of directed feedback vertex set

This page was built for publication: