Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation

Documenti analoghi

• Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
  di: Deák, Bence, et al.
  Pubblicazione: (2026)
• Separable convex optimization over indegree polytopes
  di: Borsik, Nóra A., et al.
  Pubblicazione: (2025)
• Faster algorithms for packing forests in graphs and related problems
  di: Arkhipov, Pavel, et al.
  Pubblicazione: (2024)
• Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
  di: Alecu, Bogdan, et al.
  Pubblicazione: (2024)
• Parameterised algorithms for temporally satisfying reconfiguration problems
  di: Davot, Tom, et al.
  Pubblicazione: (2025)