scientific article; zbMATH DE number 6784970
From MaRDI portal
Publication:5363775
Recommendations
- Linear kernels for outbranching problems in sparse digraphs
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
- A linear-time kernelization for the rooted k-leaf outbranching problem
- Linear kernels for separating a graph into components of bounded size
- Linear problem kernels for planar graph problems with small distance property
- Kernels and partial line digraphs
- A new generalization of kernels in digraphs
- Kernelization using structural parameters on sparse graph classes
- Kernelization using structural parameters on sparse graph classes
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Cited in
(12)- A linear-time kernelization for the rooted k-leaf outbranching problem
- Linear kernels for outbranching problems in sparse digraphs
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems
- Algorithmic properties of sparse digraphs
- \(k\)-distinct in- and out-branchings in digraphs
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
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 Q5363775)
