Packing directed cycles through a specified vertex set

DOI10.1137/1.9781611973105.27zbMath1423.05133OpenAlexW4247786141MaRDI QIDQ5741735

Stephan Kreutzer, Marek Krčál, Ken-ichi Kawarabayashi, Daniel Král'

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.27

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Recent techniques and results on the Erdős-Pósa property ⋮ Towards a polynomial kernel for directed feedback vertex set ⋮ Kernels for deletion to classes of acyclic digraphs ⋮ Unnamed Item ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Parameterised algorithms for deletion to classes of DAGs

This page was built for publication: Packing directed cycles through a specified vertex set