Thumbnail
Access Restriction
Subscribed

Author Kim, J. ♦ Patel, J. ♦ Singh, H. ♦ Anneberg, L.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Hypercubes ♦ Topology ♦ Iterative algorithms ♦ Reliability engineering ♦ Iterative methods ♦ Concurrent computing ♦ Petri nets ♦ Parallel processing ♦ Information analysis ♦ Bipartite graph
Abstract An algorithm for calculating the paths through a hypercube based on the algorithm by L. Fratta and U. Montanari (1973), which relies on a Boolean expression representation of the simple paths in the network, is given. The advantages to this algorithm are the iterative nature (which could be parallelized in the future) and the Boolean approach for the path determination.
Description Author affiliation: Dept. of Electr. Eng., Wayne State Univ., Detroit, MI, USA (Kim, J.; Patel, J.; Singh, H.)
ISBN 0780308492
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-11-11
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 187.61 kB
Page Count 5
Starting Page 928
Ending Page 932


Source: IEEE Xplore Digital Library