Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
The progress of design and fabrication technologies has led to an increase in small delay failures in systems-on-a-chip. To… 
Highly Cited
2005
Highly Cited
2005
Recent years have witnessed a growing interest in the application of wireless sensor networks in unattended environments. Nodes… 
Highly Cited
2002
Highly Cited
2002
Combinatorial auctions have recently attracted the interests of many researchers due to their promising applications such as the… 
2000
2000
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given… 
1998
1998
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between vertices i and j. The sum of all… 
1996
1996
Designers characterize system performance with such quantifiable performance attributes as throughput rate, reliability, longest… 
1995
1995
Retiming has been proposed as an optimization step for sequential circuits represented at the net-list level. Retiming moves the… 
1985
1985
This note suggests an improvement to the Monte Carlo simulation technique of Sigal, Pritsker and Solberg for estimating the…