4 articles for “Graph Coloring”

Set a search alert

Research ArticleOpen accessPhrase in the titleGraph 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

Research ArticleOpen accessPhrase in the titleOn Gröbner Bases and Their Uses in Solving System of Polynomial Equations and Graph ColoringHaridas Kumar Das, Nasim RezaThis paper is based on the analytic and computational solution procedures of Gröbner basis and its applications. We show the behavior of the ideals generated by polynomials from a polynomial ring. We also present the idea of a zero dimensional ideal and use of this ideal to solve system of polynomial equations. We then introduce an algorithmic procedure for solving … …Journal of Mathematics and Statistics, Vol. 14, Issue 1 · 27 Jun 2018 · 8,591 accessesView PDF Cite

Research ArticleOpen accessPhrase in the titleNew Graph Coloring AlgorithmsHussein Al-Omari, Khair E. SabriTwo new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 7,044 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComparison between Vertex Merge Algorithm and Dsatur AlgorithmHandrizal, A. Noraziah, Ahmed N. AbdallaProblem statement: In this study, the channel allocation problem in direct sequence spread spectrum was investigated. First, Coloring in channel allocation has been discussed in detail. Second; a new graph model is proposed that namely Vertex Merge Algorithm (VMA). Approach: VMA try to solve channel allocation based on graph theory. Results: The problem is to assign channel to Access Point … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,254 accessesView PDF Cite