scientific article; zbMATH DE number 6857816
From MaRDI portal
Publication:4634403
DOI10.4230/LIPICS.IPEC.2016.20zbMATH Open1398.68251arXiv1610.04711MaRDI QIDQ4634403FDOQ4634403
Authors: Mithilesh Kumar, Daniel Lokshtanov 
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1610.04711
Title of this publication is not available (Why is that?)
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
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)
Cited In (7)
- Kernelization for edge triangle packing and covering via a discharging method
- Parameterized Complexity of Safe Set
- Parameterized algorithms for generalizations of directed feedback vertex set
- Title not available (Why is that?)
- Linear kernels for separating a graph into components of bounded size
- Component order connectivity in directed graphs
- 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)
