Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth

Documenti analoghi

• Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
  di: Liu, Yuxi, et al.
  Pubblicazione: (2024)
• A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
  di: Tian, Kangyi, et al.
  Pubblicazione: (2026)
• Faster Parameterized Vertex Multicut
  di: Chu, Huairui, et al.
  Pubblicazione: (2026)
• Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
  di: Zhao, Jingyang, et al.
  Pubblicazione: (2023)
• An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
  di: Liu, Yuxi, et al.
  Pubblicazione: (2023)