Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,612,628 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Approximation algorithm
Clique-width
Color-coding
Complement graph
Expand
Broader (1)
Network theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A LUT-Based Approximate Adder
Andreas Becher
,
Jorge Echavarria
,
Daniel Ziener
,
Stefan Wildermann
,
J. Teich
IEEE Symposium on Field-Programmable Custom…
2016
Corpus ID: 14024250
In this paper, we propose a novel approximate adder structure for LUT-based FPGA technology. Compared with a full featured…
Expand
2012
2012
A Method for Design of Command Decision-Making Entity's Hiberarchy Architecture
Zhou Xiangxiang
2012
Corpus ID: 63199326
A new method for design of Command Decision-Making Entity's(CDME) hiberarchy architecture(command and control tree,C2T) was…
Expand
2012
2012
A Nettree for Simple Paths with Length Constraint and the Longest Path in Directed Acyclic Graphs
Li Yan
,
Sun Le
,
Zhu Huaizhong
,
Wu Youxi
2012
Corpus ID: 61807965
2010
2010
Distance and Detour Matrices of an Infinite Class of Dendrimer Nanostars
A. Karbasioun
,
A. Ashrafi
,
M. Diudea
2010
Corpus ID: 124464890
Let G be a graph. The Wiener index of G is defined as the sum of all pairwise distances of vertices of the graph. Suppose DD…
Expand
2008
2008
Using Stigmergy to Solve Numerical Optimization Problems
P. Korošec
,
J. Silc
Computing and informatics
2008
Corpus ID: 12700276
The current methodology for designing highly efficient technological systems needs to choose the best combination of the…
Expand
2003
2003
Dynamic conditional branch balancing during the high-level synthesis of control-intensive designs
S. Gupta
,
N. Dutt
,
Rajesh K. Gupta
,
A. Nicolau
Design, Automation and Test in Europe Conference…
2003
Corpus ID: 15204415
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps…
Expand
2000
2000
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)
G. Klau
,
K. Klein
,
Petra Mutzel
International Symposium Graph Drawing and Network…
2000
Corpus ID: 27696904
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given…
Expand
1998
1998
Graphs with the Same Detour Matrix
M. Randi
,
Luz M. DeAlba
,
Frank E. Harrisb
1998
Corpus ID: 12306681
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…
Expand
1997
1997
Timing-driven placement for regular architectures
Anmol Mathur
,
C. 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…
Expand
1996
1996
Performance Modeling Using PDL
R. Vemuri
,
Ram Manday
,
Vijay Meduri
Computer
1996
Corpus ID: 11157542
Designers characterize system performance with such quantifiable performance attributes as throughput rate, reliability, longest…
Expand