Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,357,901 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
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
2004
2004
Video summarization by spatial-temporal graph optimization
Shi Lu
,
Michael R. Lyu
,
Irwin King
IEEE International Symposium on Circuits and…
2004
Corpus ID: 14350627
In this paper we present a novel approach for video summarization based on graph optimization. Our approach emphasizes both a…
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
Highly Cited
2002
Highly Cited
2002
Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing
Koutarou Suzuki
,
M. Yokoo
Financial Cryptography
2002
Corpus ID: 5868264
Combinatorial auctions have recently attracted the interests of many researchers due to their promising applications such as the…
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
Milan 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
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)
ACCEPT & CONTINUE