This project implements and optimizes algorithms for analyzing large-scale graphs using Apache Hadoop MapReduce. The primary objectives are: Graph Diameter Calculation: To compute the diameter of a ...

Abstract: Diameter of an undirected graph is the maximal distance between any two vertices. We can obtain a digraph (directed graph) by presenting a direction for each edge of the undirected graph.

Abstract: A fundamental step in the analysis of a massive graph is to compute its diameter. In the RAM model, the diameter of a connected undirected unweighted graph can be efficiently 2-approximated ...

Separate graph into connected components. Set the size of each connected components. Search for the longest diameters in each connected graph. But the current algorithm will have issue when the ...

This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

ABSTRACT: Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R, denoted by , is a graph with vertices in , which is the set of all non-zero and non-unit elements of R, and ...