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

   @article{Blondel07,
   author = {Vincent D. Blondel and Jean-Loup Guillaume and Julien M. Hendrickx and Rapha\"{e}l M. Jungers},
   title = "Distance distribution in random graphs and application to network exploration",
   journal = {Physical Review E},
   number = {066101},
   volume = {76},
   year = "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.
   

   @InProceedings{Bader07:ApproxBC,
   author = {Bader, D.A. and Kintali, S. and Madduri, K. and Mihail, M.},
   title = {Approximating betweenness centrality},
   booktitle = {Algorithms and Models for the Web-Graph},
   year = {2007},
   series = {Lecture Notes in Computer Science},
   volume = {4863},
   pages = {124--137},
   publisher = {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.
   

   @inproceedings{Berry07:mtgl,
   author = {Jonathan W. Berry and Bruce Hendrickson and Simon Kahanz and Petr Konecny},
   title = {Software and Algorithms for Graph Queries on Multithreaded Architectures},
   booktitle = {IPDPS '07: Proceedings of the 21st International Parallel and Distributed Processing Symposium },
   month = {March},
   year = {2007},
   isbn = {1-4244-0910-1},
   publisher = {IEEE},
   address = {Long Beach, CA} 
   }
   




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]
   

   @inproceedings{Kulkarni07:pldi,
   Address = {New York, NY, USA},
   Author = {Milind Kulkarni and Keshav Pingali and Bruce Walter and Ganesh Ramanarayanan and Kavita Bala and L. Paul Chew},
   Booktitle = {PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation},
   Doi = {http://doi.acm.org/10.1145/1250734.1250759},
   Isbn = {978-1-59593-633-2},
   Location = {San Diego, California, USA},
   Pages = {211--222},
   Publisher = {ACM},
   Title = {Optimistic parallelism requires abstractions},
   Year = {2007},
   
   }
   




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.
   

   @InProceedings{Madduri07:ALEXNEX,
   author = {K. Madduri and D.A. Bader and J.W. Berry and J.R. Crobak},
   title = {An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances},
   booktitle = {Workshop on Algorithm Engineering and Experiments (ALENEX)},
   address = {New Orleans, LA},
   month = {January},
   year = {2007} 
   }
   

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.

This document was translated from BibT_EX by bibtex2html