Computing connected components of graphs

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    In this article, we represent an algorithm for finding connected elements in an undirected graph with n vertices based on adjacency matrix.

    Keywords: Connected Components, Adjacency Matrix, and Undirected Graph.

  • References

    1. J. Bondy, U. Murty, Graph Theory with Applications, MacMillan, New York, (1976).
    2. R. Diestel, Graph Theory, 4th Electronic Edition, (2010).
    3. R. Miller, L. Boxer, Algorithms Sequential and Parallela Unified Approach, Second Edition, Charles River Media, (2005).
    4. D. Jungnickel, Graphs, networks and algorithms, Berlin, Second Auflage, (2005).
    5. S. Steven, the Algorithm Design Manual, (2011).




Article ID: 3189
DOI: 10.14419/ijamr.v3i4.3189

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.