A Methodology for Evaluating Parallel Graph Algorithms and Its Application to Single Source Reachability.

@inproceedings{DBLP:conf/pdis/WolfsonZBKM93,
  author    = {Ouri Wolfson and
               Weining Zhang and
               Harish Butani and
               Akira Kawaguchi and
               Kui W. Mok},
  title     = {A Methodology for Evaluating Parallel Graph Algorithms and Its
               Application to Single Source Reachability},
  booktitle = {Proceedings of the 2nd International Conference on Parallel and
               Distributed Information Systems (PDIS 1993), Issues, Architectures,
               and Algorithms, San Diego, CA, USA, January 20-23, 1993},
  publisher = {IEEE Computer Society},
  year      = {1993},
  isbn      = {0-8186-3330-1},
  pages     = {243-250},
  ee        = {db/conf/pdis/WolfsonZBKM93.html},
  crossref  = {DBLP:conf/pdis/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-7 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition