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.
2016
2016
A LUT-Based Approximate Adder
In this paper, we propose a novel approximate adder structure for LUT-based FPGA technology. Compared with a full featured… 
2012
2012
A Method for Design of Command Decision-Making Entity's Hiberarchy Architecture
A new method for design of Command Decision-Making Entity's(CDME) hiberarchy architecture(command and control tree,C2T) was… 
2012
2012
A Nettree for Simple Paths with Length Constraint and the Longest Path in Directed Acyclic Graphs
2008
2008
Using Stigmergy to Solve Numerical Optimization Problems
The current methodology for designing highly efficient technological systems needs to choose the best combination of the… 
2004
2004
Video summarization by spatial-temporal graph optimization
In this paper we present a novel approach for video summarization based on graph optimization. Our approach emphasizes both a… 
2003
2003
Dynamic conditional branch balancing during the high-level synthesis of control-intensive designs
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps… 
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
Timing-driven placement for regular architectures
  • Anmol MathurC. Liu
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1997
  • Corpus ID: 6663840
We present a new iterative algorithm for timing-driven placement applicable to regular architectures such as field-programmable… 
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)