Graph Traversal Algorithms (BFS/DFS) for Community Detection in Social Networks (Extended V۲)

This extended paper examines the application of graph traversal algorithms—Breadth-First Search (BFS) and Depth-First Search (DFS)—in social network analysis and community detection. Several synthetic graphs are used to illustrate BFS/DFS as preliminary methods. We extend the examples with larger graphs, additional communities, extended pseudo-code, figures, and tables, showing the scalability and limitations of these traversal techniques. This document is structured to occupy a substantial page count in order to meet conference requirements.

کلیدواژه ها:

Social Network ، Graph Traversal ، BFS ، DFS ، Community Detection