Login / Signup
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Júlio Araújo
Victor A. Campos
Ana Karolinna Maia
Ignasi Sau
Ana Silva
Published in:
LATIN (2018)
Keyphrases
</>
computational complexity
worst case
shortest path
machine learning
information retrieval
artificial intelligence
website
mobile robot
decision problems
space complexity
undirected graph
optimal path
lower complexity
method finds