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

Algorithms for symbolic reduction of signal flow graphs

โœ Scribed by Maciej Szymkat


Book ID
108453706
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
724 KB
Volume
42
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Parallel Algorithms for Reducible Flow G
โœ Vijaya Ramachandran ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 324 KB

We present parallel NC algorithms for recognizing a reducible flow graph rfg and for finding dominators, minimum feedback vertex sets, and a depth first search ลฝ . tree in an rfg. On an n-node rfg, all of these algorithms run in polylog n time ลฝ . ลฝ . using M n processors, where M n is the number o