Path Length Computations on Graph Models of Computations

DOI10.1109/T-C.1969.222705MaRDI QIDQ5576020zbMATH OpenOpenAlexFDO

Authors David Martin, Gerald Estrin

Publication date 1969

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1969.222705

zbMATH Keywords

computer science and automata

Cited in

(4)

• A survey of scheduling methods for multiprocessor systems
• Methods and means of parallel processing of information
• Finite stochastic automata with variable transition probabilities
• Applications of graph theory in computer systems

This page was built for publication: Path Length Computations on Graph Models of Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576020)