Abstract

In this paper we study a question of representing a group of associative algorithms on an abstract model of the SIMD type with vertical data processing (the STAR-machine). This group includes the Warshall transitive closure algorithm, the Floyd shortest path algorithm and the Maggs-Plotkin minimal spanning tree algorithm. These algorithms are represented as the corresponding STAR procedures whose correctness is verified and time complexity is evaluated.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.