Login / Signup
Low time complexity algorithms for path computation in Cayley Graphs.
Daniela Aguirre-Guerrero
Guillaume Ducoffe
Lluís Fàbrega
Pere Vilà
David Coudert
Published in:
Discret. Appl. Math. (2019)
Keyphrases
</>
graph theory
low time complexity
learning algorithm
significant improvement
linear algebra
optimization problems
computationally efficient
computational efficiency
genetic algorithm
lower bound
benchmark datasets
orders of magnitude
graph theoretic