BACK TO INDEX

Internal reports
2005
  1. D A Bader and K Madduri. Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors.. Technical report, 2005.


  2. Piotr Luszczek, Jack J. Dongarra, David Koester, Rolf Rabenseifner, Bob Lucas, Jeremy Kepner, John Mccalpin, David Bailey, and Daisuke Takahashi. Introduction to the HPC Challenge Benchmark Suite. Technical report ICL-UT-05-01, ICL, 2005.


2004
  1. D.A. Bader, G. Cong, and J. Feo. A comparison of the performance of list ranking and connected components algorithms on SMP and MTA shared-memory systems. Technical report, October 2004.


2001
  1. Lubos Brim, Ivana Cerná, Pavel Krcál, and Radek Pelánek. Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths. Technical report FIMU-RS-2001-01, Faculty of Informatics, Masaryk University, May 2001. [PDF] Keyword(s): Single-source shortest paths.


  2. A.V. Goldberg. A simple shortest path algorithm with linear average time. Technical report, STAR Lab., InterTrust Tech., Inc., 2001.


2000
  1. Isabelle Guérin Lassous, Jens Gustedt, and Michel Morvan. Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. Technical report 3885, INRIA, February 2000. [PDF] Keyword(s): Interval graphs, Sorting, Connected components, Maximum Weighted Clique, CGM.


1998
  1. Michelle Hribar, Valerie Taylor, and David E. Boyce. Parallel Shortest Path Algorithms: Identifying the Factors that Affect Performance. Technical report CPDC-TR-9803-015, Center for Parallel and Distributed Computing, Northwestern University, January 1998. [POSTSCRIPT] Keyword(s): Single-source shortest paths.


  2. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, November 1998. [PDF] Keyword(s): PageRank.


1992
  1. T. Steihaug and A. Hossain. Graph coloring and the estimation of sparse Jacobian matrices using row and column partitioning. Technical report Report 72, Department of Informatics, University of Bergen, 1992. [WWW]


1971
  1. J.M. Anthonisse. The rush in a directed graph. Technical report BN9/71, Stichting Mahtematisch Centrum, Amsterdam, 1971.



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Fri Aug 24 15:59:35 2012
Author: ngedmond.


This document was translated from BibTEX by bibtex2html