Lajos L. Pongracz

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general graphs, since it includes the Hamiltonian path problem as a special case [3]. Motivated by finding a simple, quick(More)
  • 1