More efficient topological sort using reconfigurable optical buses

DOI10.1023/A:1022080713267zbMATH Open1062.68143OpenAlexW2142201259MaRDI QIDQ1402302FDOQ1402302

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

Recommendations

• scientific article; zbMATH DE number 3958742
• Publication:4206412
• On the complexity of topological sorting
• scientific article; zbMATH DE number 2040827
• I/O-efficient algorithms for topological sort and related problems

zbMATH Keywords

analysis of algorithmstime complexitymassive parallelismgraph problemoptical bus

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of topological sorting
• Sorting an array using the topological sort of a corresponding comparison graph

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)