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

A parallel optimal routing algorithm

โœ Scribed by Cassilda Ribeiro; Didier El Baz

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
562 KB
Volume
18
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Algorithm for Global Routing
A Parallel Algorithm for Global Routing Using an Associative Processor
โœ Taegeun Park ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

This paper proposes a parallel approach to global routing using an associative processor (AP). The proposed architecture, which is very efficient for search-oriented applications, consists of three main functional blocks: the content-addressable memory (CAM) array, the row logic, and the control sec

An Optimal Parallel Matching Algorithm f
An Optimal Parallel Matching Algorithm for Cographs
โœ R. Lin; S. Olariu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v