1. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7--15, 1989.
   

   @Article{Kamada89:GraphDrawing,
   
   author = {T. Kamada and S. Kawai},
   
   title = {An algorithm for drawing general undirected graphs},
   
   journal = {Information Processing Letters},
   
   year = 1989,
   
   volume = 31,
   
   pages = {7--15} 
   }
   




2. 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 ]
   Keywords: Depth-first search, Distributed system, distributed algorithm, communication graph.

   Abstract:

   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.

   
   

   @Article{SharmaIyengarMandyamDFS89,
   
   author = {Mohan B. Sharma and Sitharama S. Iyengar and Narasimha K. Mandyam},
   
   title = {An efficient distributed depth-first-search algorithm},
   
   journal = {Information Processing Letters},
   
   volume = {32},
   
   number = {4},
   
   year = {1989},
   
   pages = {183--186},
   
   publisher = {Elsevier North-Holland, Inc.},
   
   keywords = {Depth-first search; Distributed system; distributed algorithm; communication graph},
   
   pdf = {PAPERS/SharmaIyengarMandyamDFS89.pdf},
   
   abstract = {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.} 
   }
   

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

   @inproceedings{George89:minimum_degree,
   
   author = {Alan George and Joseph W. H. Liu},
   
   title = {The Evolution of the Minimum Degree Ordering Algorithm},
   
   journal = {{SIAM} Review},
   
   year = 1989,
   
   month = {March},
   
   volume = 31,
   
   number = 1,
   
   pages = {1--19} 
   }
   

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