More efficient topological sort using reconfigurable optical buses

DOI10.1023/A:1022080713267MaRDI QIDQ1402302zbMATH OpenOpenAlexFDO

Authors Jie Li, Hong Shen, Yi Pan

Publication date 20 August 2003

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

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

zbMATH Keywords

analysis of algorithmsgraph problemmassive parallelismoptical bustime complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 3958742
• Publication:4206412
• On the complexity of topological sorting
• Faster sorting on a linear array with a reconfigurable pipelined bus system
• I/O-efficient algorithms for topological sort and related problems

Cited in

(4)

• Sorting an array using the topological sort of a corresponding comparison graph
• scientific article; zbMATH DE number 3958742 (Why is no real title available?)
• scientific article; zbMATH DE number 4126713 (Why is no real title available?)
• On the complexity of topological sorting

This page was built for publication: More efficient topological sort using reconfigurable optical buses

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