Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
From MaRDI portal
Publication:2849356
DOI10.1007/978-3-642-40450-4_57zbMath1371.68114arXiv1210.0260OpenAlexW3022047830MaRDI QIDQ2849356
No author found.
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.0260
Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Unnamed Item ⋮ On Directed Steiner Trees with Multiple Roots ⋮ Directed Steiner trees with diffusion costs ⋮ Extending the kernel for planar Steiner tree to the number of Steiner vertices ⋮ The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy ⋮ On the parameterized complexity of compact set packing ⋮ Parameterized study of Steiner tree on unit disk graphs ⋮ Greedy domination on biclique-free graphs ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Unnamed Item ⋮ Complexity of Steiner Tree in Split Graphs - Dichotomy Results ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Lossy Kernels for Hitting Subgraphs
This page was built for publication: Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
