Solving graph theory problems using reconfigurable pipelined optical buses

DOI10.1016/S0167-8191(99)00126-XMaRDI QIDQ1575305zbMATH OpenFDO

Authors Keqin Li, Yi Pan, Mounir Hamdi

Publication date 21 August 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(99)00126-X

zbMATH Keywords

graph algorithmsoptical computingpipelined communicationreconfigurable networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
• scientific article; zbMATH DE number 1302051
• Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
• scientific article; zbMATH DE number 1751891

Cited in

(4)

• Optical Routing of Uniform Instances in Cayley Graphs
• scientific article; zbMATH DE number 1302051 (Why is no real title available?)
• Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
• Optimally scaling permutation routing on reconfigurable linear arrays with optical buses

This page was built for publication: Solving graph theory problems using reconfigurable pipelined optical buses

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