BACK TO INDEX

Conference articles
2009
  1. 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:http://dx.doi.org/10.1109/IPDPS.2009.5161100]


2007
  1. 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.


  2. 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.


  3. 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:http://doi.acm.org/10.1145/1250734.1250759]


  4. 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.


2006
  1. 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.


  2. 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:http://dx.doi.org/10.1109/ICPP.2006.57]


  3. 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.


  4. 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.


  5. John R. Gilbert, Steve Reinhardt, and Viral Shah. High-Performance Graph Algorithms from Parallel Sparse Matrices. In PARA, pages 260-269, 2006.


2005
  1. 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.


  2. 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.


  3. 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.


  4. Douglas Gregor and Andrew Lumsdaine. The Execution Instance Overloading Pattern. In Workshop on Patterns in High-Performance Computing, 2005.


  5. 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.


  6. 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.


  7. 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:http://dx.doi.org/10.1109/CSBW.2005.13]


2004
  1. 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.


  2. Douglas Gregor and Andrew Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. In , 2004. Note: Submitted.


2003
  1. 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.


  2. 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.


2002
  1. 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.


  2. 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.


2001
  1. 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.


  2. 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.


  3. 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.


  4. 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.


  5. 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.


  6. 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:http://doi.acm.org/10.1145/502512.502551]


  7. 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.


  8. A.V. Goldberg. Shortest Path Algorithms: Engineering Aspects. In Proceedings of 12th International Symposium, ISAAC, pages 502-512, 2001. Springer.


  9. 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.


  10. 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.


  11. 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.


2000
  1. 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.


  2. 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.


  3. 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.


  4. 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.


1999
  1. 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:http://doi.acm.org/10.1145/316188.316229] Keyword(s): Scale-free graphs.


  2. 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]


  3. 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]


1998
  1. 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.


  2. 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.


  3. 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.


  4. 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.


  5. 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.


  6. 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.


  7. 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.


  8. 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.


1997
  1. 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]


  2. 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.


  3. 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.


  4. 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.


  5. 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.


  6. 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.


1996
  1. 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.


1995
  1. 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.


  2. 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:http://doi.acm.org/10.1145/224964.224968] Keyword(s): Biconnected components.


1994
  1. 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.


1993
  1. 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.


  2. 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.


  3. 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.


1992
  1. 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.


1991
  1. 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.


  2. 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.


1989
  1. Alan George and Joseph W. H. Liu. The Evolution of the Minimum Degree Ordering Algorithm. In , volume 31, pages 1-19 , March 1989.


1987
  1. 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.


  2. 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.


1985
  1. 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:http://dx.doi.org/10.1109/SFCS.1985.43]


1984
  1. 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.



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