On an algorithm of a generalized graph construction for digital device (Q2740491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On an algorithm of a generalized graph construction for digital device |
scientific article; zbMATH DE number 1646961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an algorithm of a generalized graph construction for digital device |
scientific article; zbMATH DE number 1646961 |
Statements
2 November 2001
0 references
graph
0 references
digital circuit
0 references
On an algorithm of a generalized graph construction for digital device (English)
0 references
An algorithm for the design of a generalized graph for digital device based on applying the attainable and contraattainable sets is presented. It is established that the most frequently used operations may be implemented only on the basis of standard fast computer instructions (and, or, compare, shift etc). The implementation resources of proposed algorithm depend rather on the length of computer words than on the order of the graph matrix.
0 references
