All publications sorted by Books and proceedings
  1. Rick Durrett,. Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press, New York, NY, USA, 2006. ISBN: 0521866561. [bibtex-key = Durret:RandomGraph]

  2. Will Schroeder, Ken Martin, and Bill Lorensen. The Visualization Toolkit. Kitware Inc., 2003. [bibtex-key = Schroeder:VTK]

  3. B. Bollobas. Random Graphs. Cambridge University Press, 2001. [bibtex-key = Bollobas01:random_graphs]

  4. Dieter Jungnickel. Graphs, Networks and Algorithms. Springer, Heidelberg, 1999. [bibtex-key = Jungnickel99:Graphs]

  5. J.K. Cullum and R.A. Willoughby. Lanczos algorithms for Large Symmetric Eigenvalue Computations. Volume 1, Theory. Birkhäuser, 1985. [bibtex-key = CullumWilloughby1985]

  6. Todd L. Veldhuizen. Active Libraries and Universal Languages. PhD thesis, Indiana University Computer Science, May 2004. [PDF] [bibtex-key = Veldhuizen04:thesis]

  7. Vincent D. Blondel, Jean-Loup Guillaume, Julien M. Hendrickx, and Raphaël M. Jungers. Distance distribution in random graphs and application to network exploration. Physical Review E, 76(066101), 2007. [bibtex-key = Blondel07]

  8. Michalis Faloutsos and Mart Molle. A linear-time optimal-message distributed algorithm for minimum spanning trees. Distributed Computing, 17(2):151-170, August 2004. [PDF] Keyword(s): Minimum spanning tree. [bibtex-key = FaloutsosMolleMST04]

  9. U. Meyer and P. Sanders. $\Delta$-stepping: A parallelizable shortest path algorithm. J. Algorithms, 49(1):114-152, 2003. ISSN: 0196-6774. [doi:] [bibtex-key = Meyer03:DeltaStepping]

  10. F. Dehne, A. Ferreira, E. Cáceres, S. W. Song, and A. Roncato. Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica, 33(2):183-200, January 2002. [PDF] Keyword(s): List ranking, Euler tour, Connected components, Lowest common ancestor, CGM, BSP. [bibtex-key = DehneFerreriraCaceresCGM02]

  11. Mehmet Hakan Karaata. A stabilizing algorithm for finding biconnected components. J. Parallel Distrib. Comput., 62(5):982-999, 2002. ISSN: 0743-7315. [PDF] [doi:] Keyword(s): Biconnected components. [bibtex-key = KaraataBiconnected02]

  12. Thomas Nitsche. Lifting Sequential Functions to Parallel Skeletons. Parallel Processing Letters, 12(2):267-284, June 2002. [bibtex-key = Nitsche02:Lifting]

  13. Y. H. Tsin. Some remarks on distributed depth-first search. Information Processing Letters, 82(4):173-178, 2002. ISSN: 0020-0190. [PDF] Keyword(s): Analysis of algorithms, Depth-first search, Distributed algorithm, Communication network.
    Overview of many distributed and parallel depth-first search algorithms
    [bibtex-key = TsinDFS02]

  14. Ulrik Brandes. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001. [bibtex-key = brandes01:_mathsoc]

  15. Art Kazmierczak and Sridhar Radhakrishnan. An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing. IEEE Trans. Parallel Distrib. Syst., 11(2):110-118, 2000. ISSN: 1045-9219. [PDF] [doi:] Keyword(s): Biconnected components, Ear decomposition. [bibtex-key = KazmierczakEar00]

  16. Albert-Laszlo Barabasi and Reka Albert. Emergence of scaling in random networks. Science, 286:509-512, October 1999. [PDF] Keyword(s): Random graphs, Scale-free graphs. [bibtex-key = BarabasiAlbertScale99]

  17. G. Bilardi, A. Pietracaprina, G. Pucci, K. T. Herley, and P. Spirakis. BSP versus LogP. Algorithmica, 24(3/4):405-422, August 1999. [PDF] Keyword(s): BSP, LogP.
    A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very efficient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic analysis. It is also shown that the two models can be implemented with similar performance on most point-to-point networks. In conclusion, within the limits of our analysis that is mainly of an asymptotic nature, BSP and (stall-free) LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation. BSP seems somewhat preferable due to its greater simplicity and portability, and slightly greater power. LogP lends itself more naturally to multiuser mode.
    [bibtex-key = BilardiPietracaprinaPucciBSPvsLogP99]

  18. George Karypis and Vipin Kumar. Multilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998. [WWW] [bibtex-key = karypis98multilevel]

  19. Bala Swaminathan and Kenneth J. Goldman. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs. Algorithmica, 22(3):305-329, November 1998. [PDF] Keyword(s): Biconnected components. [bibtex-key = SwaminathanBiconnected98]

  20. Duncan Watts and Steven Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998. [PDF] [bibtex-key = WattsStrogatzSmallWorld98]

  21. Philip N. Klein and Sairam Subramanian. A randomized parallel algorithm for single-source shortest paths. Journal of Algorithms, 25(2):205-220, November 1997. [POSTSCRIPT] Keyword(s): CRCW, PRAM, Single-source shortest paths. [bibtex-key = KleinSubramanianSSSP97]

  22. Ramakrishna Thurimella. Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components. Journal of Algorithms, 23(1):160-189, April 1997. [PDF] Keyword(s): Biconnected components. [bibtex-key = ThurimellaBiconnected97]

  23. B. Mohár. Some applications of Laplace eigenvalues of graphs. 1997. [bibtex-key = mohar97some]

  24. David E. Culler, Richard M. Karp, David Patterson, Abhijit Sahay, Eunice E. Santos, Klaus Erik Schauser, Ramesh Subramonian, and Thorsten von Eicken. LogP: a practical model of parallel computation. Communications of the ACM, 39(11):78-85, 1996. ISSN: 0001-0782. [PDF] Keyword(s): LogP. [bibtex-key = CullerKarpPattersonLogP96]

  25. S. A. M. Makki and George Havas. Distributed algorithms for depth-first search. Information Processing Letters, 60(1):7-12, 1996. [PDF] Keyword(s): Distributed system, Depth-first search, Distributed algorithm, communication graph.
    We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient than previous methods. Our algorithms require $2|V| − 2$ messages and units of time in the worst case, where $|V|$ is the number of sites in the network, and as little as $|V|$ messages and time units in the best case. The actual number of messages and time units depends on the network topology and possibly on the routing chosen. We can interpret this to mean that the number of messages and time units is $|V|(1 + r)$ in the worst case, where $0 \leq r < 1$ and the value of $r$ depends on the topology and the routing. In a best case for the simplest algorithm, for example when the underlying network has a ring topology, $r = 0$ and our basic algorithm requires $|V|$ messages and time units, regardless of routing. We extend the basic algorithm to achieve the same best case bound for other topologies. The worst case bound, which has $r = 1 − 2/|V|$, applies if the network topology is a tree. The improvement over the best of previous algorithms is achieved by dynamic backtracking, with a minor increase in message length.
    [bibtex-key = MakkiHavasDFS96]

  26. Alexander A. Stepanov. Generic Programming. Lecture Notes in Computer Science, 1181:40, 1996. ISSN: 0302-9743. [bibtex-key = Stepanov96:GP]

  27. J.-M. Jézéquel. EPEE: an Eiffel Environment to Program Distributed Memory Parallel Computers. Journal of Object Oriented Programming, 1993. [bibtex-key = Jezequel93:EPEE]

  28. K. Ramarao and S. Vekatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13(2):235-257, June 1992. Keyword(s): Single-source shortest paths. [bibtex-key = RamaraoVekatesanSSSP92]

  29. T. Fruchterman and E. Reingold. Graph Drawing by Force-Directed Placement. Software--Practice and Experience, 21(11):1129-1164, 1991. [bibtex-key = Fruchterman91:GraphDrawing]

  30. Alok Aggarwal, Richard J. Anderson, and Ming-Yang Kao. Parallel depth-first search in general directed graphs. SIAM Journal on Computing, 19(2):397-409, 1990. ISSN: 0097-5397. [PDF] Keyword(s): Depth-first search, PRAM. [bibtex-key = AggarwalAndersonKaoDFS90]

  31. Denis Caromel. Concurrency and reusability: from sequential to parallel. Journal of Object Oriented Programming, 3(3):34-42, 1990. ISSN: 0896-8438. [bibtex-key = Caromel90:SeqToParallel]

  32. Walter Hohberg. How to Find Biconnected Components in Distributed Networks.. Journal of Parallel and Distributed Computint, 9(4):374-386, 1990. Keyword(s): Biconnected components. [bibtex-key = HohbergBiconnected90]

  33. Devendra Kumar, Sitharama S. Iyengar, and Mohan B. Sharma. Corrections to a distributed depth-first search algorithm. Information Processing Letters, 35(1):55-56, 1990. [PDF] Keyword(s): Distributed system, distributed algorithm, communication graph, Depth-first search. [bibtex-key = KumarIyengarSharmaDFS90]

  34. Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990. ISSN: 0001-0782. [PDF] Keyword(s): BSP. [bibtex-key = ValiantBSP90a]

  35. Leslie G. Valiant. General purpose parallel architectures. In Handbook of theoretical computer science (vol. A): algorithms and complexity, pages 943-973. MIT Press, 1990. ISBN: 0-444-88071-2. Keyword(s): BSP. [bibtex-key = ValiantBSP90b]

  36. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989. [bibtex-key = Kamada89:GraphDrawing]

  37. Mohan B. Sharma, Sitharama S. Iyengar, and Narasimha K. Mandyam. An efficient distributed depth-first-search algorithm. Information Processing Letters, 32(4):183-186, 1989. [PDF] Keyword(s): Depth-first search, Distributed system, distributed algorithm, communication graph.
    The sequential depth-first-search algorithm, distributed over processor nodes of a graph, yields a distributed depth-first-search algorithm that uses exactly $2|V|$ messages and $2|V|$ units of time.
    [bibtex-key = SharmaIyengarMandyamDFS89]

  38. Isreal Cidon. Yet another distributed depth-first-search algorithm. Information Processing Letters, 26(6):301-305, 1988. [PDF] Keyword(s): Distributed system, distributed algorithm, asynchronous, depth-first-search.
    A new distributed depth-first-search algorithm is presented whose communication and time complexities are bounded by $3|E|$ and $2|V|$, respectively.
    This formulation contains an error. See the corrected result in Tsin's {\em Some remarks on distributed depth-first search}.
    [bibtex-key = CidonDFS88]

  39. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343-1354, 1988. ISSN: 0001-0782. [PDF] Keyword(s): Single-source shortest paths, EREW, PRAM. [bibtex-key = DriscollGabowShrairman88]

  40. Hillel Gazit and Gary L. Miller. An improved parallel algorithm that computes the BFS numbering of a directed graph. Information Processing Letters, 28(2):61-65, 1988. ISSN: 0020-0190. [PDF] Keyword(s): Breadth-first search, fast matrix multiplication, parallel algorithm, EREW, PRAM.
    This paper presents a parallel algorithm that computes the breadth-first search (BFS) numbering of a directed graph in $O(log^2 n)$ time using $M(n)$ processors on the exclusive-read exclusive-write (EREW) parallel random access machine (PRAM) model, where $M(n)$ denotes the number of processors needed to multiply two $n imes n$ integer matrices over the ring $({\mathbb Z}, +, x)$ in $O(log n)$ time. The best known bound for $M(n)$ is $O(n^2.376)$ (Coppersmith and Winograd, 1987). The algorithm presented in their paper uses fewer processors than the classical algorithm for BFS that employs matrix powering over the semiring (dioid) $({\mathbb N}, min, +)$, using $O(log n)$ time and $O(n^3)$ processors on the concurrent-read concurrent-write (CRCW) model, or using $O(log^2 n)$ time and $n^3log n$ processors on the EREW model.
    [bibtex-key = GazitMillerBFS88]

  41. K. B. Lakshmanan, N. Meenakshi, and K. Thulasiraman. A time-optimal message-efficient distributed algorithm for depth-first-search. Information Processing Letters, 25(2):103-109, 1987. [PDF] Keyword(s): Depth-first search.
    In this paper we study the problem of distributed construction of a depth-first-search tree for an asynchronous communication network. First, we point out that any algorithm requires at least $2n−2$ time units and $2m$ messages in the worst case, where n and m are the number of nodes and the number of edges in the network, respectively. We then provide a modification to a recent algorithm due to Awerbuch (1985), and show that the new algorithm is time-optimal, while requiring less then $4m−(n−1)$ messages.
    [bibtex-key = LakshmananMeenakshiThulasiramanDFS87]

  42. S. W. Sloan. An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering, 23:239-251, 1986. [bibtex-key = Sloan86:ordering]

  43. Baruch Awerbuch. A new distributed depth-first-search algorithm. Information Processing Letters, 20(3):147-150, 1985. [PDF] Keyword(s): Depth-first search, Distributed system, communication graph.
    This paper presents a new distributed Depth-First-Search (DFS) algorithm for an asynchronous communication network, whose communication and time complexities are $O(|E|)$ and $O(|V|)$, respectively. The output of the algorithm is the DFS tree, kept in a distributed fashion. The existing algorithm, due to Cheung (1983), requires $O(|E|)$ both in communication and time complexities.
    [bibtex-key = AwerbuchDFS85]

  44. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985. [bibtex-key = Frieze85]

  45. Refael Hassin and Eitan Zemel. On Shortest Paths in Graphs with Random Weights. Mathematics of Operations Research, 10(4):557-564, November 1985. [bibtex-key = Hassin85]

  46. John H. Reif. Depth-First Search is Inherently Sequential. Information Processing Letters, 20(5):229-234, June 1985. [PDF] Keyword(s): Depth-first search, parallel computation, polynomial time complete.
    This paper concerns the computational complexity of depth-first search. Suppose we are given a rooted graph G with fixed adjacency lists and vertices u, v. We wish to test if u is first visited before v in depth-first search order of G. We show that this problem, for undirected and directed graphs, is complete in deterministic polynomial time with respect to deterministic log-space reductions. This gives strong evidence that depth-first search ordering can be done neither in deterministic space $(log n)^c$ nor in parallel time $(log n)^c$, for any constant $c > 0$.
    [bibtex-key = ReifDFS85]

  47. R. E. Tarjan and U. Vishkin. An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput., 14(4):862-874, 1985. Keyword(s): Biconnected components. [bibtex-key = TarjanBiconnected85]

  48. David W. Matula and Leland L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30(3):417-427, 1983. ISSN: 0004-5411. [doi:] [bibtex-key = Matula83:SLVordering]

  49. Yossi Shiloach and Uzi Vishkin. An $\mathcal{O}(log\ n)$ parallel connectivity algorithm. Journal of Algorithms, 3(1):57-67, 1982. [bibtex-key = ShiloachViskin82:CC]

  50. Linton C. Freeman. A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1):35-41, March 1977. [bibtex-key = Freeman77]

  51. Donald B. Johnson. Efficient Algorithms for Shortest Paths in Sparse Networks. Journal of the ACM, 24(1):1-13, 1977. ISSN: 0004-5411. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = JohnsonSSSP77]

  52. J. R. Ullmann. An Algorithm for Subgraph Isomorphism. Journal of the ACM, 23:31-42, January 1976. ISSN: 0004-5411. [WWW] [doi:] [bibtex-key = Ullmann76:subgraph]

  53. E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11:1277-1280, 1970. [bibtex-key = DinicMaxFlow70]

  54. I.P. King. An automatic reordering scheme for simultaneous equations derived from network analysis. International Journal for Numerical Methods in Engineering, 2:523-533, 1970. [bibtex-key = King70:ordering]

  55. Gert Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581-603, December 1966. [bibtex-key = Sabidussi66]

  56. Paul Erdös and Alfred Renyi. On random graphs. Publicationes Mathematicae Debrecen, 6:290-297, 1959. Keyword(s): Random graphs. [bibtex-key = ErdosRenyiRandom59]

  57. K. Madduri, D. Ediger, K. Jiang, D.A. Bader, and D. Chavarria-Miranda. A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets. In Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP 2009), May 2009. IEEE Computer Society. [doi:] [bibtex-key = Madduri09:MTAAP]

  58. D.A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In Algorithms and Models for the Web-Graph, volume 4863 of Lecture Notes in Computer Science, pages 124-137, 2007. Springer-Verlag. [bibtex-key = Bader07:ApproxBC]

  59. Jonathan W. Berry, Bruce Hendrickson, Simon Kahanz, and Petr Konecny. Software and Algorithms for Graph Queries on Multithreaded Architectures. In IPDPS '07: Proceedings of the 21st International Parallel and Distributed Processing Symposium, Long Beach, CA, March 2007. IEEE. ISBN: 1-4244-0910-1. [bibtex-key = Berry07:mtgl]

  60. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, pages 211-222, 2007. ACM. ISBN: 978-1-59593-633-2. [doi:] [bibtex-key = Kulkarni07:pldi]

  61. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak. An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007. [bibtex-key = Madduri07:ALEXNEX]

  62. D.A. Bader and K. Madduri. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. In Proceedings of 35th International Conference on Parallel Processing, pages 523-530, August 2006. [bibtex-key = Bader06:BFS-MTA]

  63. David A. Bader and Kamesh Madduri. Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks. In ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing, Washington, DC, pages 539-550, 2006. IEEE. ISBN: 0-7695-2636-5. [doi:] [bibtex-key = Bader06:centrality]

  64. Alex Breuer, Peter Gottschling, Douglas Gregor, and Andrew Lumsdaine. Effecting Parallel Graph Eigensolvers Through Library Composition. In Performance Optimization for High-Level Languages and Libraries (POHLL), April 2006. [bibtex-key = Breuer06:GraphEigen]

  65. Nick Edmonds, Alex Breuer, Douglas Gregor, and Andrew Lumsdaine. Single-Source Shortest Paths with the Parallel Boost Graph Library. In The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, Piscataway, NJ, November 2006. [bibtex-key = edmonds06:dimacs]

  66. John R. Gilbert, Steve Reinhardt, and Viral Shah. High-Performance Graph Algorithms from Parallel Sparse Matrices. In PARA, pages 260-269, 2006. [bibtex-key = Gilbert06:para]

  67. Erik G. Boman, Doruk Bozdag, Umit Catalyurek, Assefaw H. Gebremedhin, and Fredrik Manne. A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. In Lecture Notes in Computer Science, volume 3648, pages 241-251, August 2005. [bibtex-key = Boman05:Coloring]

  68. Guojing Cong and David A. Bader. An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). In 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), 2005. [PDF] Keyword(s): Biconnected components. [bibtex-key = CongBaderBiconnected05]

  69. Douglas Gregor and Andrew Lumsdaine. Lifting Sequential Graph Algorithms for Distributed-Memory Parallel Computation. In Proceedings of the 2005 ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 423-437, October 2005. [bibtex-key = Gregor:OOPSLA:2005]

  70. Douglas Gregor and Andrew Lumsdaine. The Execution Instance Overloading Pattern. In Workshop on Patterns in High-Performance Computing, 2005. [bibtex-key = Gregor05:eio_pattern]

  71. Douglas Gregor and Andrew Lumsdaine. The Parallel BGL: A Generic Library for Distributed Graph Computations. In In Proceedings of the Fourth Workshop on Parallel Object-Oriented Scientific Computing, July 2005.
    This paper presents the Parallel BGL, a generic C++ library for distributed graph computation. Like the sequential Boost Graph Library (BGL) upon which it is based, the Parallel BGL applies the paradigm of generic programming to the domain of graph computations. Emphasizing efficient generic algorithms and the use of concepts to specify the requirements on type parameters, the Parallel BGL also provides flexible supporting data structures such as distributed adjacency lists and external property maps. The generic programming approach simultaneously stresses flexibility and efficiency, resulting in a parallel graph library that can adapt to various data structures and communication models while retaining the efficiency of equivalent hand-coded programs. Performance data for selected algorithms are provided demonstrating the efficiency and scalability of the Parallel BGL.
    [bibtex-key = Gregor:POOSC:2005]

  72. Jurij Leskovec, Deepayan Chakrabarti, Jon Kleinberg, and Christos Faloutsos. Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pages 133-145, 2005. Springer. [bibtex-key = Leskovec05:Kronecker]

  73. Qiaofeng Yang and Stefano Lonardi. A Parallel Algorithm for Clustering Protein-Protein Interaction Networks. In CSBW '05: Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference - Workshops, Washington, DC, USA, pages 174-177, 2005. IEEE Computer Society. ISBN: 0-7695-2442-7. [doi:] [bibtex-key = Yang05]

  74. D Chakrabarti, Y Zhan, and C Faloutsos. R-MAT: A Recursive Model for Graph Mining. In Proceedings of 4th International Conference on Data Mining, pages 442-446, April 2004. [bibtex-key = Chakrabarti04:Recursive]

  75. Douglas Gregor and Andrew Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. In , 2004. Note: Submitted. [bibtex-key = GregorLumsdainePBGL04]

  76. Lubos Brim, Ivana Cerná, and Lukás Hejtmánek. Parallel Algorithms for Detection of Negative Cycles. In PARCO, 2003. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = BrimCernaHejtmanekSSSP03]

  77. Albert Chan and Frank Dehne. CGM graph/CGM lib: Implementing and Testing CGM Graph Algorithms on PC Clusters. In PVM/MPI, pages 117-125, 2003. [PDF] Keyword(s): List ranking, Euler tour, Connected components, Bipartite detection, CGM, CGMgraph. [bibtex-key = ChanDehneCGMgraph03]

  78. Bin Luo, Richard C. Wilson, and Edwin R. Hancock. Spectral Feature Vectors for Graph Clustering. In Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, London, UK, pages 83-93, 2002. Springer-Verlag. ISBN: 3-540-44011-9. [bibtex-key = LWH_SpectralClustering2002]

  79. Saeko Nomura, Satoshi Oyama, Tetsuo Hayamizu, and Toru Ishida. Analysis and Improvement of HITS Algorithm for Detecting Web Communities. In SAINT '02: Proceedings of the 2002 Symposium on Applications and the Internet, Washington, DC, USA, pages 132-140, 2002. IEEE Computer Society. ISBN: 0-7695-1447-2. [bibtex-key = 691405]

  80. P. An, A. Jula, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: A Standard Template Adaptive Parallel C++ Library. In International Workshop on Advanced Compiler Technology for High Performance and Embedded Processors, pages 10, July 2001. [PDF] Keyword(s): STAPL. [bibtex-key = AnSTAPL01a]

  81. Ping An, Alin Jula, Silvius Rus, Steven Saunders, Tim Smith, Gabriel Tanase, Nathan Thomas, Nancy Amato, and Lawrence Rauchwerger. STAPL: An Adaptive, Generic Parallel Programming Library for C++. In Workshop on Languages and Compilers for Parallel Computing, pages 193-208, August 2001. [PDF] Keyword(s): STAPL. [bibtex-key = AnSTAPL01b]

  82. L. Brim, I. Cerná, P. Krcál, and R. Pelánek. How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In L. Pacholski and P. Ruziccka, editors, SOFSEM'01, number 2234 of Lecture Notes in Computer Science, pages 191-200, 2001. Springer Verlag. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = BrimCernaKrcalSSSP01]

  83. Libor Bus and Pavel Tvrdìk. A Parallel Algorithm for Connected Components on Distributed Memory Machines. In Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface, pages 280-287, 2001. Springer-Verlag. ISBN: 3-540-42609-4. [PDF] Keyword(s): CGM, Connected components. [bibtex-key = BusTvrdikConnectedComponents01]

  84. E.N. Cáceres, S.W. Song, and J.L. Szwarcfiter. A Parallel Unrestricted Depth Search Algorithm. In Proc. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. 1, pages 521-526, June 2001. [PDF] Keyword(s): Unrestricted depth search, CGM, BSP. [bibtex-key = CaceresSongSzwarcfiterUDS01]

  85. Chris H. Q. Ding, Xiaofeng He, and Hongyuan Zha. A spectral method to separate disconnected and nearly-disconnected web graph components. In KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, pages 275-280, 2001. ACM Press. ISBN: 1-58113-391-X. [doi:] [bibtex-key = 502551]

  86. David Eppstein, and Joseph Wang,. Fast approximation of centrality. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pages 228-229, 2001. Society for Industrial and Applied Mathematics. ISBN: 0-89871-490-7. [bibtex-key = Eppstein01]

  87. A.V. Goldberg. Shortest Path Algorithms: Engineering Aspects. In Proceedings of 12th International Symposium, ISAAC, pages 502-512, 2001. Springer. [bibtex-key = Goldberg01:MLB]

  88. William C. McLendon III, Bruce Hendrickson, Steve Plimpton, and Lawrence Rauchwerger. Identifying strongly connected components in parallel. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, March 2001. [POSTSCRIPT] Keyword(s): Strongly connected components, STAPL. [bibtex-key = McLendonHendricksonPlimptonSCC01]

  89. Ulrich Meyer. Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. In Rizos Sakellariou, John Keane, John R. Gurd, and Len Freeman, editors, 7th International Euro-Par Conference, volume 2150 of Lecture Notes in Computer Science, pages 343-351, August 2001. Springer. [PDF] Keyword(s): Single-source shortest paths, CRCW, PRAM. [bibtex-key = MeyerSSSP01]

  90. Aris Pagourtzis, Igor Potapov, and Wojciech Rytter. PVM Computation of the Transitive Closure: The Dependency Graph Approach. In Yannis Cotronis and Jack Dongarra, editors, Recent Advances in Parallel Virtual Machine and Message Passing Interface, 8th European PVM/MPI Users' Group Meeting, volume 2131 of Lecture Notes in Computer Science, pages 249-256, September 2001. Springer. [PDF] Keyword(s): Transitive closure, PVM. [bibtex-key = PagourtzisPotapovRytterTC01]

  91. Lisa Fleischer, Bruce Hendrickson, and Ali Pinar. On Identifying Strongly Connected Components in Parallel. In Parallel and Distributed Processing (IPDPS), volume 1800 of Lecture Notes in Computer Science, pages 505-511, 2000. Springer. [POSTSCRIPT] Keyword(s): Strongly connected components. [bibtex-key = FleischerHendricksonPinarSCC00]

  92. Attila Gürsoy and Murat Atun. Neighborhood Preserving Load Balancing: A Self-Organizing Approach. In Euro-Par Parallel Processing, volume 1900 of Lecture Notes in Computer Science, pages 324-341, 2000. [bibtex-key = Gursoy00:layout]

  93. Ulrich Meyer and Peter Sanders. Parallel Shortest Path for Arbitrary Graphs. In Proceedings from the 6th International Euro-Par Conference on Parallel Processing, pages 461-470, 2000. Springer-Verlag. ISBN: 3-540-67956-1. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = MeyerSandersSSSP00]

  94. Christopher R. Palmer and J. Gregory Steffan. Generating network topologies that obey power laws. In Proceedings of GLOBECOM '2000, November 2000. [PDF] Keyword(s): Random graphs, Scale-free graphs. [bibtex-key = PalmerSteffanRandom00]

  95. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the Internet topology. In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pages 251-262, 1999. ACM Press. ISBN: 1-58113-135-6. [PDF] [doi:] Keyword(s): Scale-free graphs. [bibtex-key = FaloutsosScale99]

  96. Lie-Quan Lee, Jeremy Siek, and Andrew Lumsdaine. Generic Graph Algorithms for Sparse Matrix Ordering. In International Symposium on Computing in Object-Oriented Parallel Environments, volume 1732 of Lecture Notes in Computer Science, pages 120-129, 1999. Springer-Verlag. [PDF] [bibtex-key = lee99:iscope]

  97. Lie-Quan Lee, Jeremy Siek, and Andrew Lumsdaine. The Generic Graph Component Library. In Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 339-414, 1999. [PDF] [bibtex-key = lee99:oopsla]

  98. Micah Adler, Wolfgang Dittrich, Ben Juurlink, Mirosław Kutyłowski, and Ingo Rieping. Communication-optimal parallel minimum spanning tree algorithms. In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, pages 27-36, 1998. ACM Press. ISBN: 0-89791-989-0. [PDF] Keyword(s): Minimum spanning tree. [bibtex-key = AdlerDittrichJuurlinkMST98]

  99. Noga Alon, Michael Krivelevich, and Benny Sudakov. Finding a large hidden clique in a random graph. In SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pages 594-598, 1998. Society for Industrial and Applied Mathematics. ISBN: 0-89871-410-9. [bibtex-key = 315014]

  100. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A Parallelization of Dijkstra's Shortest Path Algorithm. In Lubos Brim, Jozef Gruska, and Jirì Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 722-731, 1998. Springer. [PDF] Keyword(s): Single-source shortest paths, CRCW, PRAM. [bibtex-key = CrauserMehlhornMeyerSSSP98]

  101. Frank Dehne and Silvia Götz. Practical Parallel Algorithms for Minimum Spanning Trees. In Symposium on Reliable Distributed Systems, pages 366-371, 1998. [PDF] Keyword(s): Minimum spanning tree. [bibtex-key = DehneGotzMST98]

  102. Afonso Ferreira, Isabelle Guerin Lassous, K. Marcus, and Andrew Rau-Chaplin. Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments. In European Conference on Parallel Processing, pages 875-886, 1998. [POSTSCRIPT] Keyword(s): Interval graph, Connected components, Maximum Weighted Clique, Breadth-first Search, Depth-first Search, CGM. [bibtex-key = FerreiraLassousMarcusInterval98]

  103. Ulrich Meyer and Peter Sanders. Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. In Proceedings of the 6th Annual European Symposium on Algorithms, pages 393-404, 1998. Springer-Verlag. ISBN: 3-540-64848-8. [bibtex-key = Meyer98:Delta]

  104. L. Rauchwerger, F. Arzu, and K. Ouchi. Standard Templates Adaptive Parallel Library. In Wkshp. on Lang. Comp. and Run-time Sys. for Scal. Comp. (LCR), volume 1511 of LNCS, pages 402-410, May 1998. [PDF] Keyword(s): STAPL. [bibtex-key = RauchwergerSTAPL98]

  105. Todd L. Veldhuizen and Dennis Gannon. Active Libraries: Rethinking the roles of compilers and libraries. In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing, 1998. SIAM Press. [bibtex-key = Veldhuizen98:active_libraries]

  106. D. Eppstein, Z. Galil, and G. Italiano. Dynamic graph algorithms. In In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, pages 95, 1997. [WWW] [bibtex-key = Eppstein97:dynamic]

  107. Steve Goddard, Subodh Kumar, and Jan F. Prins. Connected Components Algorithms For Mesh Connected Parallel Computers. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43-58, 1997. American Mathematical Society. [PDF] Keyword(s): Connected components, CRCW, PRAM. [bibtex-key = GoddardKumarPrinsCC97]

  108. Michelle Hribar, Valerie Taylor, and David E. Boyce. Performance study of parallel shortest path algorithms: Characteristics of good decompositions. In Proceedings from ISUG '97 Conference, 1997. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = HribarTaylorBoyceSSSP97]

  109. Tsan-Sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean. Parallel implementation of algorithms for finding connected components in graphs. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 23-42, 1997. American Mathematical Society. [POSTSCRIPT] Keyword(s): Connected components, CRCW, PRAM. [bibtex-key = HsuRamachandranDeanCC97]

  110. Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, and Katherine Yelick. Connected components on distributed memory machines. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-22, 1997. American Mathematical Society. [POSTSCRIPT] Keyword(s): Connected components, PRAM. [bibtex-key = KrishnamurthyLumettaCullerCC97]

  111. Marios Papaefthymiou and Joseph Rodrigue. Implementing parallel shortest-paths algorithms. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 59-68, 1997. American Mathematical Society. [PDF] Keyword(s): Single-source shortest paths. [bibtex-key = PapaefthymiouRodrigueSSSP97]

  112. Armin Bäumker and Wolfgang Dittrich. Parallel Algorithms for Image Processing: Practical Algorithms with Experiments. In 10th International Parallel Processing Symposium (IPPS '96), pages 429-433, April 1996. Keyword(s): Mesh graph, Connected components, BSP. [bibtex-key = BaumkerDittrichImage96]

  113. Steven S. Lumetta, Arvind Krishnamurthy, and David E. Culler. Towards modeling the performance of a fast connected components algorithm on parallel machines. In Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), pages 32-49, 1995. ACM Press. ISBN: 0-89791-816-9. [PDF] Keyword(s): Mesh graph, Connected components. [bibtex-key = LumettaKrishnamurthyCullerCC95]

  114. Ramakrishna Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. In PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, New York, NY, USA, pages 28-37, 1995. ACM Press. Note: Use the complete journal version of this arcticle, ThurimellaBiconnected97. ISBN: 0-89791-710-3. [PDF] [doi:] Keyword(s): Biconnected components. [bibtex-key = ThurimellaBiconnected95]

  115. John Greiner. A comparison of parallel algorithms for connected components. In Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, pages 16-25, 1994. ACM Press. ISBN: 0-89791-671-9. [PDF] Keyword(s): Connected components, PRAM. [bibtex-key = GreinerCC94]

  116. David E. Culler, Richard Karp, David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. LogP: towards a realistic model of parallel computation. In Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 1-12, 1993. ACM Press. ISBN: 0-89791-589-5. [PDF] Keyword(s): LogP.
    A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. it is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples that are implemented on the CM-5.
    [bibtex-key = CullerKarpPattersonLogP93]

  117. Frank Dehne, Andreas Fabri, and Andrew Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proceedings of the Ninth Annual Symposium on Computational Geometry, pages 298-307, 1993. ACM Press. ISBN: 0-89791-582-8. [PDF] Keyword(s): CGM. [bibtex-key = DehneFabriRauCGM93]

  118. J.-M. Jézéquel. Transparent Parallelisation Through Reuse: Between a Compiler and a Library Approach. In O. M. Nierstrasz, editor, ECOOP'93 proceedings, number 707 of Lecture Notes in Computer Science, pages 384-405, July 1993. Springer Verlag. [bibtex-key = Jezequel93:Transparent]

  119. Donald B. Johnson and Panagiotis Takis Metaxas. A Parallel Algorithm for Computing Minimum Spanning Trees. In ACM Symposium on Parallel Algorithms and Architectures, pages 363-372, 1992. [bibtex-key = JohnsonMetaxasMST92]

  120. Kien A. Hua and Sridhar S. Hannenhalli. Parallel transitive closure computations using topological sort. In Proceedings of the first international conference on Parallel and distributed information systems, pages 122-129, 1991. IEEE Computer Society Press. ISBN: 0-8186-2295-4. Keyword(s): Transitive closure, Topological sort.
    Deals with parallel transitive closure computations. The sort-based approaches introduced sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distributed across several processing nodes of a message passing multiprocessor system. This data partitioning strategy allows the transitive closure computation of the local data fragments to be computed in parallel with no interprocessor communication. The construction of the final result then requires only a small number of joins. Extensive analytical results are included in the paper as well. They show that the proposed techniques leads to a speedup that is essentially linear with the number of processors. Its performance is significantly better than the recently published hashless parallel algorithm
    [bibtex-key = HuaHannenhalliTC91]

  121. Vipin Kumar and Vineet Singh. Scalability of parallel algorithms for the all-pairs shortest path problem. In Proceedings of the International Conference on Parallel Processing, pages 124-138, 1991. [bibtex-key = Kumar91]

  122. Alan George and Joseph W. H. Liu. The Evolution of the Minimum Degree Ordering Algorithm. In , volume 31, pages 1-19 , March 1989. [bibtex-key = George89:minimum_degree]

  123. Alok Aggarwal and Richard J. Anderson. A random NC algorithm for depth first search. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 325-334, 1987. ACM Press. ISBN: 0-89791-221-7. [PDF] Keyword(s): Depth-first search, PRAM. [bibtex-key = AggarwalAndersonDFS87]

  124. Jing-fu Jenq and Sartaj Sahni. All Pairs Shortest Paths on a Hypercube Multiprocessor. In Proceedings of the International Conference on Parallel Processing, pages 713-716, 1987. [bibtex-key = Jenq87]

  125. Gary L. Miller and John H. Reif. Parallel tree contraction and its application. In : Proceedings of the 26th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pages 478-489, 1985. IEEE. ISBN: 0-8186-0844-4. [doi:] [bibtex-key = Miller85]

  126. R.E. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. In Proc. 25th Symp. Found. Comp. Sci., pages 12-20, 1984. Keyword(s): Biconnected components. [bibtex-key = TarjanBiconnected84]

  127. D A Bader and K Madduri. Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors.. Technical report, 2005. [bibtex-key = Bader05:Design]

  128. 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. [bibtex-key = Luszczek05:hpcc]

  129. 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. [bibtex-key = Bader04:ListRanking]

  130. 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. [bibtex-key = BrimCernaKrcalSSSP01b]

  131. A.V. Goldberg. A simple shortest path algorithm with linear average time. Technical report, STAR Lab., InterTrust Tech., Inc., 2001. [bibtex-key = Goldberg01:Caliber]

  132. 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. [bibtex-key = LassousGustedtMorvanCGM00]

  133. 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. [bibtex-key = HribarTaylorBoyceSSSP98]

  134. 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. [bibtex-key = PageBrinPR98]

  135. 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] [bibtex-key = Steihaug92:graph]

  136. J.M. Anthonisse. The rush in a directed graph. Technical report BN9/71, Stichting Mahtematisch Centrum, Amsterdam, 1971. [bibtex-key = Anthonisse71]

  137. David A. Bader and others. HPC Scalable Graph Analysis Benchmark. 1.0 edition, September 2009. Note: Rl [bibtex-key = hpc_graph_analysis_benchmark]

  138. 9$^ ext{th}$ DIMACS Implementation Challenge - Shortest Paths. rl challenge9/, March 2006. [bibtex-key = DIMACS:ShortestPaths]

  139. David A. Bader and Kamesh Madduri. GTgraph: A suite of synthetic graph generators. rl kamesh/GTgraph/, February 2006. [bibtex-key = GTgraph]

  140. Kamesh Madduri, David Bader, Jonathan W. Berry, and Joseph R. Crobak. Parallel Shortest Path Algorithms for Solving Large-Scale Instances. 9$^\text{th}$ DIMACS Implementation Challenge - Shortest Paths, 2006. Note: An updated version of the paper appears in this book. [bibtex-key = Bader06:Dimacs]

  141. Douglas Gregor, Nick Edmonds, Alex Breuer, Peter Gottschling, Brian Barrett, and Andrew Lumsdaine. The Parallel Boost Graph Library. Note: \texttt, 2005. [bibtex-key = ParallelBGL]

  142. Christopher Mueller, Douglas Gregor, and Andrew Lumsdaine. Distributed Graph Visualization. Note: Submitted, October 2005. [bibtex-key = Mueller05:DistributedGraphViz]

  143. DARPA Information Processing Technology Office. High productivity computing systems project. rl, 2004. [bibtex-key = DARPA:HPCS]

  144. Florian Hielscher and Peter Gottschling. ParGraph. Note: \texttt, 2004. Keyword(s): ParGraph. [bibtex-key = ParGraph]

  145. Scott White, Joshua O'Madadhain, Danyel Fisher, and Yan-Biao Boey. Java Universal Network/Graph Framework. Note: \texttt, 2004. [bibtex-key = JUNG]

  146. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Extrapolation methods for accelerating PageRank computations, 2003. [WWW] [bibtex-key = kamvar03extrapolation]

  147. Scalable Synthetic Compact Application Benchmarks. rl [bibtex-key = SSCA]

  148. Erik G. Boman, Doruk Bozdag, Umit Catalyurek, Assefaw H. Gebremedhin, and Fredrik Manne. A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Note: Preprint. [bibtex-key = Boman05Coloring]

  149. U.S. Census Bureau. UA Census 2000 extscTIGER/ extscLine Files. Note: Rl [bibtex-key = TIGERLine]

  150. Albert Chan and Frank Dehne. cgmLIB: A Library For Coarse-Grained Parallel Computing. Note: \texttt, 2004 December. Keyword(s): CGMgraph. [bibtex-key = CGMlib]

  151. PTV Europe. European Road Graphs. Note: Rl [bibtex-key = PTVRoad]

  152. Mathias Troyer and Prakash Dayal. The Iterative Eigensolver Template Library. Note: \texttt [bibtex-key = IETLdoc]



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:37 2012
Author: ngedmond.

This document was translated from BibTEX by bibtex2html