Login / Signup

A linear algorithms for the two paths problem on permutation graphs.

C. P. GopalakrishnanC. Pandu Rangan
Published in: Discuss. Math. Graph Theory (1995)
Keyphrases
  • graph theory
  • learning algorithm
  • computationally efficient
  • computational complexity
  • orders of magnitude
  • np complete
  • shortest path
  • benchmark datasets
  • linear models