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

An algorithm to optimally color a mesh

โœ Scribed by Jean-Jacques Droux

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
802 KB
Volume
104
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Sorting Algorithm on Reconfig
An Optimal Sorting Algorithm on Reconfigurable Mesh
โœ J. Jang; V.K. Prasanna ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 853 KB

This paper shows nontrivial ways to use the Reconfigurable Mesh to solve several basic arithmetic problems in constant time. These solutions are obtained by novel ways to represent numbers and by exploiting the reconfigurability of the architecture. In particular, a constant time algorithm to add \(

A Time-Optimal Multiple Search Algorithm
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
โœ D. Bhagavathi; S. Olariu; W. Shen; L. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 739 KB

Given a sorted sequence \(A=a_{1}, a_{2}, \ldots, a_{n}\) of items from a totally ordered universe, along with an arbitrary sequence \(Q=q_{1}\), \(q_{2}, \ldots, q_{m}(1 \leq m \leq n)\) of queries, the multiple search problem involves computing for every \(q_{j}(1 \leq j \leq m)\) the unique \(a_{