BACK TO INDEX

Articles in journal, book chapters
2007
  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.


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


2003
  1. U. Meyer and P. Sanders. $\Delta$-stepping: A parallelizable shortest path algorithm. J. Algorithms, 49(1):114-152, 2003. ISSN: 0196-6774. [doi:http://dx.doi.org/10.1016/S0196-6774(03)00076-2]


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


  2. Mehmet Hakan Karaata. A stabilizing algorithm for finding biconnected components. J. Parallel Distrib. Comput., 62(5):982-999, 2002. ISSN: 0743-7315. [PDF] [doi:http://dx.doi.org/10.1006/jpdc.2001.1833] Keyword(s): Biconnected components.


  3. Thomas Nitsche. Lifting Sequential Functions to Parallel Skeletons. Parallel Processing Letters, 12(2):267-284, June 2002.


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


2001
  1. Ulrik Brandes. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001.


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


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


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


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


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


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


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


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


  3. B. Mohár. Some applications of Laplace eigenvalues of graphs. 1997.


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


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


  3. Alexander A. Stepanov. Generic Programming. Lecture Notes in Computer Science, 1181:40, 1996. ISSN: 0302-9743.


1993
  1. J.-M. Jézéquel. EPEE: an Eiffel Environment to Program Distributed Memory Parallel Computers. Journal of Object Oriented Programming, 1993.


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


1991
  1. T. Fruchterman and E. Reingold. Graph Drawing by Force-Directed Placement. Software--Practice and Experience, 21(11):1129-1164, 1991.


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


  2. Denis Caromel. Concurrency and reusability: from sequential to parallel. Journal of Object Oriented Programming, 3(3):34-42, 1990. ISSN: 0896-8438.


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


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


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


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


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


  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] Keyword(s): Depth-first search, Distributed system, distributed algorithm, communication graph.


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


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


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


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


1986
  1. S. W. Sloan. An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering, 23:239-251, 1986.


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


  2. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.


  3. Refael Hassin and Eitan Zemel. On Shortest Paths in Graphs with Random Weights. Mathematics of Operations Research, 10(4):557-564, November 1985.


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


  5. R. E. Tarjan and U. Vishkin. An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput., 14(4):862-874, 1985. Keyword(s): Biconnected components.


1983
  1. 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:http://doi.acm.org/10.1145/2402.322385]


1982
  1. Yossi Shiloach and Uzi Vishkin. An $\mathcal{O}(log\ n)$ parallel connectivity algorithm. Journal of Algorithms, 3(1):57-67, 1982.


1977
  1. Linton C. Freeman. A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1):35-41, March 1977.


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


1976
  1. J. R. Ullmann. An Algorithm for Subgraph Isomorphism. Journal of the ACM, 23:31-42, January 1976. ISSN: 0004-5411. [WWW] [doi:http://doi.acm.org/10.1145/321921.321925]


1970
  1. E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11:1277-1280, 1970.


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


1966
  1. Gert Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581-603, December 1966.


1959
  1. Paul Erdös and Alfred Renyi. On random graphs. Publicationes Mathematicae Debrecen, 6:290-297, 1959. Keyword(s): Random graphs.



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