A Self-Stabilizing (&amp;#x00394;+ 1)- Edge-Coloring Algorithm of Arbitrary Graphs

Drira, Kaouther; Dekar, Lyes; Kheddouci, Hamamache

doi:10.1109/pdcat.2009.71

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Previous Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

2012

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A self stabilizing edge-coloring algorithm [5] was proposed by Kauther and Dekar which works well for small graphs. Another method to solve the graph coloring problem was introduced by Wang and Qiao which use a non-monotonous activation function [6] .…”

Section: A Previous Workmentioning

confidence: 99%

Graph Coloring with Minimum Colors: An Easy Approach

Mittal

Jain

Mathur

et al. 2011

2011 International Conference on Communication Systems and Network Technologies

View full text Add to dashboard Cite

In this paper we introduce an approach for solving the graph coloring problem. The problem is a NP-complete problem and the complexities of almost all the available algorithms are very high. On the other hand, the algorithms that have lesser complexity, does not provide an optimal solution. In this paper, we put forth a technique for coloring a graph with minimum number of colors and in significantly lesser time than any other technique by processing the edge table we use to represent a graph.

show abstract

Section: A Previous Workmentioning

confidence: 99%