302 search results - page 22 / 61 » Efficient Algorithms for the Longest Path Problem |
ISCAS
1994
IEEE
14 years 21 days ago
1994
IEEE
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
VLSID
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
ICDCS
1998
IEEE
14 years 26 days ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...