2 results for “adjacent vertices”

Set a search alert

Research ArticleOpen accessIn the keywordsEvaluating the Performance of Equitable Dominating based Content Distribution Network DesignAmutharaj Joyson, Radhakrishnan ShanmugasundaramProblem statement: In this study, we considered an efficient and resilient large file content push problem in a large scale distributed content delivery networks and investigated the Quality of Service (QoS) requirements for content distribution. We investigated the effect of equitable dominating set in SON formation and how it was useful in reducing the redundancy? Approach: At first, we constructed … …Journal of Computer Science, Vol. 7, Issue 8 · 16 Jul 2011 · 6,654 accessesView PDF Cite

Research ArticleOpen accessIn the abstractGraph Coloring Program of Exam Scheduling Modeling Based on Bitwise Coloring Algorithm Using PythonSamsul Arifin, Indra Bayu Muktyas, Wikky Fawwaz Al Maki, Mohd Khairul Bazli Mohd AzizA graph coloring is the process of assigning labels to the vertices of a graph in such a way that no two adjacent vertices have the same color. The chromatic number of a graph G is the smallest number of colors that can be assigned to it. Graph coloring has a wide range of applications and is commonly used to … …Journal of Computer Science, Vol. 18, Issue 1 · 1 Feb 2022 · 9,702 accessesView PDF Cite