Record Details

Graph Coloring Problems in Modern Computer Science

European Journal of Interdisciplinary Studies

View Archive Info
 
 
Field Value
 
Title Graph Coloring Problems in Modern Computer Science
 
Creator Tosuni, Besjana
 
Description Graph coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science. The main aim of this paper is to present the importance of graph coloring ideas in various areas of compute applications for researches that they can use graph coloring concepts for the research. Graph coloring used in various research areas of computer science such data mining, image segmentation, clustering, image capturing, networking etc. This papers mainly focused on important applications such as Guarding an Art Gallery, Physical layout segmentation, Round-Robin Sports Scheduling, Aircraft scheduling, Biprocessor tasks, Frequency assignment, Final Exam Timetabling as a Grouping Problem, Map coloring and GSM mobile phone networks, and Student Time Table. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling. A very important graph parameter is the chromatic number. Presently, graph coloring plays an important role in several real-world applications and still engages exciting research.
 
Publisher EUSER
 
Date 2015-08-30
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Identifier http://journals.euser.org/index.php/ejis/article/view/926
10.26417/ejis.v2i1.p87-95
 
Source European Journal of Interdisciplinary Studies; Vol 1 No 2 (2015): May-August 2015; 87-95
2411-4138
2411-958X
10.26417/ejis.v2i1
 
Language eng
 
Relation http://journals.euser.org/index.php/ejis/article/view/926/915