๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient critical path tracing algorithm for sequential circuits

โœ Scribed by Hoon Chang; Jacob A. Abraham

Publisher
Elsevier Science
Year
1994
Weight
345 KB
Volume
40
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for critical circ
An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebra
โœ Geert-Jan Olsder; Kees Roos; Robert-Jan van Egmond ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

We consider the eigenvalue problem in the max-plus algebra for matrices in fร€I Rg nร‚n but with eigenvectors in R n . The problem is relaxed to a linear optimization (LO) problem of which the dual problem is solved by ยฎnding a maximal average weight circuit in the graph of the matrix. The FloydยฑWarsh

An efficient algorithm for constructing
An efficient algorithm for constructing Hamiltonian paths in meshes
โœ Shao Dong Chen; Hong Shen; Rodney Topor ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

This paper presents an efficient linear-time sequential algorithm for constructing Hamiltonian paths between two given vertices in meshes with horizontal size m and vertical size n. The algorithm first partitions the given mesh into a number of submeshes in constant steps, and then constructs a Hami

An efficient implementation of an algori
An efficient implementation of an algorithm for findingK shortest simple paths
โœ Hadjiconstantinou, E.; Christofides, N. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 263 KB ๐Ÿ‘ 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho