Login / Signup

Complexity results on the decomposition of a digraph into directed linear forests and out-stars.

Florian HörschLucas Picasarri-Arrieta
Published in: CoRR (2024)
Keyphrases
  • linear complexity
  • worst case
  • data sets
  • search algorithm
  • machine learning
  • computer vision
  • data structure
  • computational complexity
  • multiresolution
  • computational cost
  • decomposition algorithm