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

DOI10.1023/A:1016552512787zbMATH Open1019.68129OpenAlexW1546296323MaRDI QIDQ698145FDOQ698145

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1751891
• scientific article; zbMATH DE number 4033068
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Graph Problems on a Mesh-Connected Processor Array
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (3)

• Repetitions detection on a linear array with reconfigurable pipelined bus system
• Title not available (Why is that?)
• Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system

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

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