Login / Signup
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs.
Fatemeh Keshavarz-Kohjerdi
Alireza Bagheri
Published in:
Discret. Optim. (2020)
Keyphrases
</>
worst case
learning algorithm
computationally efficient
theoretical analysis
orders of magnitude
times faster
maximum clique
objective function
significant improvement
computational cost