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)

Related topics

Related topics

33 relations
Approximation algorithmClique-widthColor-codingComplement graph

Broader (1)

Network theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Recognition of Sensitized Longest Paths in Transition Delay Test
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
Efficient aggregation of delay-constrained data in wireless sensor networks
Recent years have witnessed a growing interest in the application of wireless sensor networks in unattended environments. Nodes… 
Highly Cited
2002
Highly Cited
2002
Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing
Combinatorial auctions have recently attracted the interests of many researchers due to their promising applications such as the… 
2000
2000
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given… 
1998
1998
Graphs with the Same Detour Matrix
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… 
1997
1997
Paths and cycles in extended and decomposable digraphs,
1996
1996
Performance Modeling Using PDL
Designers characterize system performance with such quantifiable performance attributes as throughput rate, reliability, longest… 
1995
1995
The Validity of Retiming Sequential Circuits
Retiming has been proposed as an optimization step for sequential circuits represented at the net-list level. Retiming moves the… 
1993
1993
On the heuristic solution of the permutation flow shop problem by path algorithms
1985
1985
Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks
This note suggests an improvement to the Monte Carlo simulation technique of Sigal, Pritsker and Solberg for estimating the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)