Oriented Coloring of Grid Graphs
Organization
Algorithms & Theory
Abstract
Oriented coloring is an extension of usual graph vertex coloring which better models applications in scheduling of jobs on processors, if the order in which jobs are executed matters.
The goal of this thesis project, is to create code which searches for grid graphs (only horizontal and vertical edges) which cannot be oriented-colored with 8 colors.
The goal of this thesis project, is to create code which searches for grid graphs (only horizontal and vertical edges) which cannot be oriented-colored with 8 colors.
Graduation Theses defence year
2016-2017
Supervisor
Abdullah Makkeh, Dirk Oliver Theis
Spoken language (s)
English
Requirements for candidates
Excellent of the C language, particularly writing fast code. Interest in coding Graph Algorithms.
Level
Bachelor, Masters
Keywords
Application of contact
Name
Abed Makkeh
Phone
E-mail
Full Document