Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system

DOI10.1023/A:1016552512787zbMath1019.68129OpenAlexW1546296323MaRDI QIDQ698145

Amitava Datta

Publication date: 18 September 2002

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016552512787

zbMATH Keywords

parallel algorithmgraph algorithmsoptical computingbiconnected componentsconnected components,minimum spanning forestreconfigurable pipelined bus

Mathematics Subject Classification ID

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

Related Items (1)

Repetitions detection on a linear array with reconfigurable pipelined bus system

This page was built for publication: Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system