Longest path problem

Known as: Longest path 
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The longest path problem on graph G is a classic problem which is to find a simple path such that the number of vertices of the… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
The longest path problem is the problem of finding a simple path with the maximum number of vertices in a given graph, and so far… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
2010
2010
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
To detect the smallest delay faults at a fault site, the longest path(s) through it must be tested at full speed. Existing test… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2003
2003
We investigate the hardness of approximating the longest path and the longest cycle in directed graphs on n vertices. We show… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We consider the problem of approximating the longest path in undirected graphs. In an attempt to pin down the best achievable… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper addresses the important subject of estimating the worst-case execution time ( WCET) of hard real-time programs… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?