k-distinct in- and out-branchings in digraphs

DOI10.4230/LIPICS.ICALP.2017.58MaRDI QIDQ5111389zbMATHOpenAlexFDO

Authors G. Gutin, Felix Reidl, Magnus Wahlström

Publication date 27 May 2020

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

zbMATH Keywords

digraphsdecompositionsFPT algorithmsbranchings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• \(k\)-distinct in- and out-branchings in digraphs
• Parameterized algorithms for non-separating trees and branchings in digraphs
• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• scientific article; zbMATH DE number 6784970
• FPT algorithms and kernels for the directed \(k\)-leaf problem

Cited in

(4)

• K-distinct branchings admits a polynomial kernel
• FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs
• scientific article; zbMATH DE number 7378329 (Why is no real title available?)
• \(k\)-distinct in- and out-branchings in digraphs

This page was built for publication: \(k\)-distinct in- and out-branchings in digraphs

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