scientific article; zbMATH DE number 6857816

DOI10.4230/LIPICS.IPEC.2016.20MaRDI QIDQ4634403zbMATH OpenFDO

Authors Mithilesh Kumar, Daniel Lokshtanov

Publication date 10 April 2018

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

zbMATH Keywords

kernelparameterized algorithmscomponent order connectivityweighted expansionmax-min allocation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7720021
• On kernelization and approximation for the vector connectivity problem
• On kernelization and approximation for the vector connectivity problem
• Kernelization and Complexity Results for Connectivity Augmentation Problems
• Kernelization and complexity results for connectivity augmentation problems
• A kernel of order \(2k - c\) for Vertex Cover
• On \((2-d)\)-kernels in the Cartesian product of graphs
• Bounds for the component order edge connectivity
• \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
• A new generalization of kernels in digraphs

Cited in

(7)

• Component order connectivity in directed graphs
• Kernelization for edge triangle packing and covering via a discharging method
• Linear kernels for separating a graph into components of bounded size
• Parameterized complexity of safe set
• scientific article; zbMATH DE number 7720021 (Why is no real title available?)
• Parameterized algorithms for generalizations of directed feedback vertex set
• Component order connectivity in directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634403)