Solving Graph Coloring Problem Using New Greedy and Probabilistic Method
- Resource Type
- Conference
- Authors
- Balakrishnan, S; Suresh, Tamilarasi; Marappan, Raja
- Source
- 2022 8th International Conference on Advanced Computing and Communication Systems (ICACCS) Advanced Computing and Communication Systems (ICACCS), 2022 8th International Conference on. 1:1992-1995 Mar, 2022
- Subject
- Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Engineering Profession
General Topics for Engineers
Power, Energy and Industry Applications
Signal Processing and Analysis
Measurement
Communication systems
Benchmark testing
Probabilistic logic
Complexity theory
Optimization
graph coloring
greedy method
combinatorial optimization
minimum color
approximation
- Language
- ISSN
- 2575-7288
Nowadays, graph coloring as a combinatorial optimization is used in different engineering domains. The chromatic integer of a connected graph is computed using either deterministic or stochastic methods. This research implements a new probabilistic approach to find the minimal coloring based on the largest degree of a graph. This stochastic method is developed using the greedy design strategy and is tested on different benchmark graph instances. It has been found that the proposed stochastic hybrid design strategy converges to the solution with reduced complexity. The performance measurement of the proposed approach is expected since it provides better performance than the recent well-known techniques.