1. 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:http://dx.doi.org/10.1109/71.841748] Keyword(s): Biconnected components, Ear decomposition.
   

   @article{KazmierczakEar00,
   author = {Art Kazmierczak and Sridhar Radhakrishnan},
   title = {An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing},
   journal = {IEEE Trans. Parallel Distrib. Syst.},
   volume = {11},
   number = {2},
   year = {2000},
   issn = {1045-9219},
   pages = {110--118},
   doi = {http://dx.doi.org/10.1109/71.841748},
   publisher = {IEEE Press},
   address = {Piscataway, NJ, USA},
   pdf = {../papers/KazmierczakEar00.pdf},
   keywords = {Biconnected components, Ear decomposition} 
   }
   

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.
   

   @InProceedings{FleischerHendricksonPinarSCC00,
   author = "Lisa Fleischer and Bruce Hendrickson and Ali Pinar",
   title = "On Identifying Strongly Connected Components in Parallel",
   booktitle = "Parallel and Distributed Processing (IPDPS)",
   series = "Lecture Notes in Computer Science",
   volume = "1800",
   pages = "505--511",
   year = "2000",
   publisher = {Springer},
   keywords = {Strongly connected components},
   ps = {PAPERS/FleischerHendricksonPinarSCC00.ps} 
   }
   




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.
   

   @inproceedings{Gursoy00:layout,
   title = {Neighborhood Preserving Load Balancing: A Self-Organizing Approach},
   author = {Attila G\"ursoy and Murat Atun},
   series = {Lecture Notes in Computer Science},
   pubisher = {Springer-Verlag},
   year = 2000,
   pages = {324--341},
   booktitle = {Euro-Par Parallel Processing},
   volume = 1900,
   
   }
   




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.
   

   @InProceedings{MeyerSandersSSSP00,
   author = {Ulrich Meyer and Peter Sanders},
   title = {Parallel Shortest Path for Arbitrary Graphs},
   booktitle = {Proceedings from the 6th International Euro-Par Conference on Parallel Processing},
   year = {2000},
   isbn = {3-540-67956-1},
   pages = {461--470},
   publisher = {Springer-Verlag},
   keywords = {Single-source shortest paths},
   pdf = {PAPERS/MeyerSandersSSSP00.pdf} 
   }
   




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.
   

   @InProceedings{PalmerSteffanRandom00,
   author = "Christopher R. Palmer and J. Gregory Steffan",
   title = "Generating network topologies that obey power laws",
   booktitle= "Proceedings of GLOBECOM '2000",
   month = "November",
   year = "2000",
   keywords = {Random graphs, Scale-free graphs},
   pdf = {PAPERS/PalmerSteffanRandom00.pdf} 
   }
   

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.
   

   @TechReport{LassousGustedtMorvanCGM00,
   author = {Isabelle Gu\'erin Lassous and Jens Gustedt and Michel Morvan},
   title = {Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms},
   institution = {INRIA},
   year = 2000,
   number = 3885,
   month = {February},
   pdf = {PAPERS/LassousGustedtMorvanCGM00.pdf},
   keywords = {Interval graphs, Sorting, Connected components, Maximum Weighted Clique, CGM} 
   }
   

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