"MINIMUM-DIAMETER CYCLIC ARRANGEMENTS IN MAPPING DATA-FLOW GRAPHS ONTO " by P ERDOS, I Koren et al.

Electrical and Computer Engineering Faculty Publication Series

Title

MINIMUM-DIAMETER CYCLIC ARRANGEMENTS IN MAPPING DATA-FLOW GRAPHS ONTO VLSI ARRAYS

Authors

P ERDOS
I Koren
S MORAN
GM SILBERMAN
S ZAKS

Publication Date

1988

Journal or Book Title

MATHEMATICAL SYSTEMS THEORY

DOI

https://doi.org/10.1007/BF02088008

Pages

85-98

Volume

Issue

Recommended Citation

ERDOS, P; Koren, I; MORAN, S; SILBERMAN, GM; and ZAKS, S, "MINIMUM-DIAMETER CYCLIC ARRANGEMENTS IN MAPPING DATA-FLOW GRAPHS ONTO VLSI ARRAYS" (1988). MATHEMATICAL SYSTEMS THEORY. 818.
https://doi.org/10.1007/BF02088008

This document is currently not available here.

COinS

ScholarWorks@UMass Amherst