scientific article; zbMATH DE number 6857816
From MaRDI portal
Publication:4634403
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
(15)- Component order connectivity in directed graphs
- Linear kernels for separating a graph into components of bounded size
- Parameterized complexity of safe set
- Parameterized algorithms for generalizations of directed feedback vertex set
- Component order connectivity in directed graphs
- scientific article; zbMATH DE number 7720021 (Why is no real title available?)
- Kernelization for edge triangle packing and covering via a discharging method
- Fundamental problems on bounded-treewidth graphs: the real source of hardness
- Combining crown structures for vulnerability measures
- Difference determines the degree: structural kernelizations of component order connectivity
- Fixed parameter multi-objective evolutionary algorithms for the W-separator problem
- Combining crown structures for vulnerability measures
- Component order connectivity admits no polynomial kernel parameterized by the distance to subdivided comb graphs
- Clustered independence and bounded treewidth
- Enumeration kernels for vertex cover and feedback vertex set
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)
