A Novel Edge Cover based Graph Coloring Algorithm

Patidar, Harish; Chakrabarti, Prąsun

doi:10.14569/ijacsa.2017.080534

Cited by 4 publications

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the hardware configuration used for experimentation in MOCA is unknown and therefore the execution mentioned in the research article is used for comparison. The comparison result with a technique based on edge cover-based graph colouring [34] and phase dynamics coupled oscillatory networks [35] finds more promising in terms of optimal colouring values for the tested graphs. The comparison results are shown in Table 9.…”

Section: Experimental Outcomes and Discussionmentioning

confidence: 98%

“…The comparison results are shown in Table 9. The comparison results are shown in Table 9 with edge cover-based graph colouring technique our greedy technique based approach is found better and produces optimal colouring values or near to optimal colouring for 11 graphs mentioned in bold entries in 3 rd column [34] in the table. Similarly on comparing with another technique reported in the literature in which researchers used oscillatory circuits for encoding the colouring problem for A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem getting the solution our technique finds more promising and achieved the optimal colouring values for the compared graphs and other fails to achieve that.…”

Section: Experimental Outcomes and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

Shukla

Bharti

Garg

2018

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

Graph colouring problem is a well-known NP-class optimization problem, studied due to a lot of applications in various real-world problems. Some of these applications are: register allocation, image processing and communication networks. There are various techniques suggested by the researchers to solve the problem which is either exact or approximate in nature. In this paper, a new greedy technique, based on degrees of vertices in the graph is presented to solve the graph colouring problem in an improved manner. The technique involves the use of adjacency matrix along with another matrix generated for the set of possible colours for each vertex in the graph. The generated colour matrix is used to assign the colours among the vertices in the graph based on decreasing degrees of the vertices. Several DIMACS colouring instances solved using the suggested approach in the article and compared with some contemporary techniques for the performance and proves compatible and having better execution time with compared technique. The obtained colouing results are mostly optimal colour values corresponding to the examined colouring instances of the graph.

show abstract

Section: Experimental Outcomes and Discussionmentioning

confidence: 98%

Section: Experimental Outcomes and Discussionmentioning

confidence: 99%

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

Shukla

Bharti

Garg

2018

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

show abstract

“…They achieve that by performing incremental color propagation as the graph changes. An attempt to reduce the time needed to color a graph is conducted in [9] where authors identify edge cover graphs and independent graphs within the graph to be colored. The graph coloring attempts for solving the scheduling problem only generate good enough solutions but they fail in finding near optimal solutions.…”

Section: A Graph Coloringmentioning

confidence: 99%

A Hybrid Exam Scheduling Technique based on Graph Coloring and Genetic Algorithms Targeted towards Student Comfort

Hassan¹,

Qtaish²,

Abuhamdeh³

et al. 2019

ijacsa

View full text Add to dashboard Cite

Scheduling is one of the vital activities needed in various aspects of life. It is also a key factor in generating exam schedules for academic institutions. In this paper we propose an exam scheduling technique that combines graph coloring and genetic algorithms. On one hand, graph coloring is used to order sections such that sections that are difficult to schedule comes first and accordingly scheduled first which helps in increasing the probability of generating valid schedules. On the other hand, we use genetic algorithms to search more effectively for more optimized schedules within the large search space. We propose a two-stage fitness function that is targeted toward increasing student comfort. We also investigate the effect and potency of the crossover operator and the mutation operator. Our experiments are conducted on a realistic dataset and the results show that a mutation only hybrid approach has a low cost and converges faster toward more optimized schedules.

show abstract

Design and Development of Compensation Topologies in WPT Using MATLAB Programming and MATLAB Simulink

Somashekar,

D. Moger

2024

Explainable AI Applications for Human Behavior Analysis

View full text Add to dashboard Cite

Wireless power transmission devices are growing in acceptance and usefulness. This chapter will discuss, examine, and contrast various compensation topologies for the transfer of inductive power. The classification of topology is changed. The difficulties of the five primary topological needs, standards, safety, and the physical underpinnings of compensatory labour are given considerable emphasis. The IPT is found to favour topologies with a series of main compensations over the four conventional systems for charging devices. If the output voltage is low, the series-parallel method is preferable since it allows for the smallest possible size of the secondary side coil. The resonance load and the magnetic coupling coefficient frequency do not affect the series-series solution. The comparative results are given in tables, graphs, and dependencies for ease of display and understanding utilising Matlab programming and Matlab Simulink. Each application has its own set of core topologies. A “one-stop” information source and selection guide for compensatory topologies in terms of devices and power level are two potential uses for the results of this research, which is the primary benefit of the study. The literature review and recent market trends for wireless power transmission devices point to the most promising future paths for topologies.

show abstract

A Novel Edge Cover based Graph Coloring Algorithm

Cited by 4 publications

References 1 publication

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

A Hybrid Exam Scheduling Technique based on Graph Coloring and Genetic Algorithms Targeted towards Student Comfort

Design and Development of Compensation Topologies in WPT Using MATLAB Programming and MATLAB Simulink

Contact Info

Product

Resources

About