Login / Signup

The complexity of minimum-length path decompositions.

Dariusz DereniowskiWieslaw KubiakYori Zwols
Published in: J. Comput. Syst. Sci. (2015)
Keyphrases
  • minimum length
  • shortest path
  • digital curves
  • computer vision
  • multiscale
  • statistical analysis
  • directed acyclic graph