Log in

Relevant bibliographies by topics / Graph coloring algorithms

Contents

Journal articles

Academic literature on the topic 'Graph coloring algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph coloring algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph coloring algorithms"

1

Mulati,, Mauro, Carla Lintzmayer, and Anderson Da Silva. "The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation." Inteligencia Artificial 18, no. 55 (2015): 81. http://dx.doi.org/10.4114/intartif.vol18iss55pp81-111.

Full text

Abstract:

Ant Colony Optimization is a metaheuristic used to create heuristic algorithms to find good solutions for combinatorial optimization problems. This metaheuristic is inspired on the effective behavior present in some species of ants of exploring the environment to find and transport food to the nest. Several works have proposed using Ant Colony Optimization algorithms to solve problems such as vehicle routing, frequency assignment, scheduling and graph coloring. The graph coloring problem essentially consists in finding a number k of colors to assign to the vertices of a graph, so that there ar

APA, Harvard, Vancouver, ISO, and other styles

2

SKULRATTANAKULCHAI, SAN, and HAROLD N. GABOW. "COLORING ALGORITHMS ON SUBCUBIC GRAPHS." International Journal of Foundations of Computer Science 15, no. 01 (2004): 21–40. http://dx.doi.org/10.1142/s0129054104002285.

Full text

Abstract:

We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones. The second algorithm is the first randomized EREW PRAM algorithm for the same problem. It uses O(n/ log n) processors and runs in O( log n) time with high probability, where n is the number of vertices of the graph. The third algorithm is the first linear-time algorithm to 5-total-color subcubic grap

APA, Harvard, Vancouver, ISO, and other styles

3

McCROAN, KEITH D., and R. C. LACHER. "REGION COLORING, EDGE COLORING, AND SCAN-CONVERSION OF MAPS." International Journal of Computational Geometry & Applications 04, no. 04 (1994): 423–55. http://dx.doi.org/10.1142/s0218195994000239.

Full text

Abstract:

A theory is introduced relating extrinsic colorings of complementary regions of an embedded graph to certain intrinsic colorings of the edges of the graph, called color cycles, that satisfy a certain self-consistency condition. A region coloring is lifted to an edge coloring satisfying the cycle condition, and a dual construction builds a region coloring from any color cycle and any embedding of the graph. Both constructs are canonical, and the constructions are information-conservative in the sense that lifting an arbitrary region coloring to a color cycle and then reconstructing a region col

APA, Harvard, Vancouver, ISO, and other styles

4

Saha, Laxman, and Pratima Panigrahi. "A new graph radio k-coloring algorithm." Discrete Mathematics, Algorithms and Applications 11, no. 01 (2019): 1950005. http://dx.doi.org/10.1142/s1793830919500058.

Full text

Abstract:

Due to the rapid growth in the use of wireless communication services and the corresponding scarcity and the high cost of radio spectrum bandwidth, Channel assignment problem (CAP) is becoming highly important. Radio [Formula: see text]-coloring of graphs is a variation of CAP. For a positive integer [Formula: see text], a radio [Formula: see text]-coloring of a simple connected graph [Formula: see text] is a mapping [Formula: see text] from the vertex set [Formula: see text] to the set [Formula: see text] of non-negative integers such that [Formula: see text] for each pair of distinct vertice

APA, Harvard, Vancouver, ISO, and other styles

5

Kralev, Velin, and Radoslava Kraleva. "An analysis between different algorithms for the graph vertex coloring problem." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 3 (2023): 2972. http://dx.doi.org/10.11591/ijece.v13i3.pp2972-2980.

Full text

Abstract:

<span lang="EN-US">This research focuses on an analysis of different algorithms for the graph vertex coloring problem. Some approaches to solving the problem are discussed. Moreover, some studies for the problem and several methods for its solution are analyzed as well. An exact algorithm (using the backtracking method) is presented. The complexity analysis of the algorithm is discussed. Determining the average execution time of the exact algorithm is consistent with the multitasking mode of the operating system. This algorithm generates optimal solutions for all studied graphs. In addit

APA, Harvard, Vancouver, ISO, and other styles

6

Al-Omari, Dr Hussein, and Khair Eddin Sabri. "New Graph Coloring Algorithms." Journal of Mathematics and Statistics 2, no. 4 (2006): 439–41. http://dx.doi.org/10.3844/jmssp.2006.439.441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dai, Zemiao, Muhammad Naeem, Zainab Shafaqat, Manzoor Ahmad Zahid, and Shahid Qaisar. "On the P3-Coloring of Bipartite Graphs." Mathematics 11, no. 16 (2023): 3487. http://dx.doi.org/10.3390/math11163487.

Full text

Abstract:

The advancement in coloring schemes of graphs is expanding over time to solve emerging problems. Recently, a new form of coloring, namely P3-coloring, was introduced. A simple graph is called a P3-colorable graph if its vertices can be colored so that all the vertices in each P3 path of the graph have different colors; this is called the P3-coloring of the graph. The minimum number of colors required to form a P3-coloring of a graph is called the P3-chromatic number of the graph. The aim of this article is to determine the P3-chromatic number of different well-known classes of bipartite graphs

APA, Harvard, Vancouver, ISO, and other styles

8

Sotskov, Yuri N. "Mixed Graph Colorings: A Historical Review." Mathematics 8, no. 3 (2020): 385. http://dx.doi.org/10.3390/math8030385.

Full text

Abstract:

This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices of the mixed graph and one coloring of the arcs and edges of the mixed graph have been considered in the literature. The unit-time scheduling problem with the makespan criterion may be interpreted as an optimal coloring of the vertices of a mixed graph, where the number of used colors is minimum. Complexity results for optimal colorings of the

APA, Harvard, Vancouver, ISO, and other styles

9

Szabó, Sándor, and Bogdán Zaválnij. "Coloring the nodes of a directed graph." Acta Universitatis Sapientiae, Informatica 6, no. 1 (2014): 117–31. http://dx.doi.org/10.2478/ausi-2014-0021.

Full text

Abstract:

Abstract It is an empirical fact that coloring the nodes of a graph can be used to speed up clique search algorithms. In directed graphs transitive subtournaments can play the role of cliques. In order to speed up algorithms to locate large transitive tournaments we propose a scheme for coloring the nodes of a directed graph. The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclusion to draw from this result is that for practical transitive tournament search algorithms

APA, Harvard, Vancouver, ISO, and other styles

10

GODDARD, WAYNE, STEPHEN T. HEDETNIEMI, DAVID P. JACOBS, and PRADIP K. SRIMANI. "SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS." International Journal of Foundations of Computer Science 16, no. 01 (2005): 19–36. http://dx.doi.org/10.1142/s012905410500284x.

Full text

Abstract:

A k-forward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called self-stabilizing. We obtain three self-stabilizing (s-s) algorithms for finding a k-forward numbering, provided one exists. One such algorithm also finds the k-height numbering of graph, generalizing s-s algorithms by Bruell et al. [4] and Antonoiu et al. [1] for finding the center of a tree. Another k-forward numbering algorithm runs in pol

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!