skip to main content
article
Free Access

Searching in parallel: a case study with the single-source shortest path algorithm

Published:01 March 1991Publication History
First page image

References

  1. 1 Chandy, K. and Misra, J., Parallel Program Design. Addison-Wesley, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Quinn, M., Designing E~cient Algorztms for Parallel Computers, McGraw-Hill, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Searching in parallel: a case study with the single-source shortest path algorithm

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGCSE Bulletin
          ACM SIGCSE Bulletin  Volume 23, Issue 1
          Mar. 1991
          369 pages
          ISSN:0097-8418
          DOI:10.1145/107005
          Issue’s Table of Contents
          • cover image ACM Conferences
            SIGCSE '91: Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
            March 1991
            392 pages
            ISBN:0897913779
            DOI:10.1145/107004

          Copyright © 1991 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 March 1991

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!