k-Distinct In- and Out-Branchings in Digraphs
From MaRDI portal
Publication:5111389
DOI10.4230/LIPIcs.ICALP.2017.58zbMath1441.68108OpenAlexW2964001867MaRDI QIDQ5111389
Gregory Gutin, Felix Reidl, Magnus Wahlström
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1612.03607
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: k-Distinct In- and Out-Branchings in Digraphs