Packing directed cycles through a specified vertex set

DOI10.1137/1.9781611973105.27MaRDI QIDQ5741735zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Marek Krčál, Stephan Kreutzer, 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)

Recommendations

• Packing cycles through prescribed vertices
• Half-integral packing of odd cycles through prescribed vertices
• Packing directed circuits through prescribed vertices bounded fractionally
• Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• Packing cycles through prescribed vertices under modularity constraints

Cited in

(16)

• Directed cut transversal packing for source-sink connected graphs
• Kernels for deletion to classes of acyclic digraphs
• Half-integral packing of odd cycles through prescribed vertices
• Packing cycles through prescribed vertices
• Parameterised algorithms for deletion to classes of DAGs
• Recent techniques and results on the Erdős-Pósa property
• Towards a polynomial kernel for directed feedback vertex set
• scientific article; zbMATH DE number 3861185 (Why is no real title available?)
• Hitting minors, subdivisions, and immersions in tournaments
• Packing directed circuits through prescribed vertices bounded fractionally
• Packing directed circuits quarter-integrally
• Towards a polynomial kernel for directed feedback vertex set
• Packing cycles faster than Erdős-Pósa
• Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
• A half-integral Erdős-Pósa theorem for directed odd cycles
• Packing directed cycles efficiently

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

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