Event Title
Graph Coloring Algorithm Using CUDA
Presentation Type
Oral and/or Visual Presentation
Presenter Major(s)
Computer Science
Mentor Information
Christian Trefftz
Department
School of Computing and Information Systems
Location
Kirkhof Center 2270
Start Date
10-4-2013 12:00 AM
End Date
10-4-2013 12:00 AM
Keywords
Information, Innovation, and Technology, Creativity/ Innovation, Mathematical Science, Technology
Abstract
Graphs are mathematical entities that can be used to model many real life systems. Graphs consist of nodes (circles) and edges that join those nodes. A classical problem in graph theory is the coloring problem. Given a particular graph, what is the minimum number of colors that are required to color the nodes of the graph if we do not want two nodes that are connected to have the same color? This problem is very difficult (time consuming) to solve. An exact algorithm to solve this problem using Graphical Processing Units (GPUs) will be described. The algorithm will work for small graphs. Performance results for some well-known graphs will be presented.
Graph Coloring Algorithm Using CUDA
Kirkhof Center 2270
Graphs are mathematical entities that can be used to model many real life systems. Graphs consist of nodes (circles) and edges that join those nodes. A classical problem in graph theory is the coloring problem. Given a particular graph, what is the minimum number of colors that are required to color the nodes of the graph if we do not want two nodes that are connected to have the same color? This problem is very difficult (time consuming) to solve. An exact algorithm to solve this problem using Graphical Processing Units (GPUs) will be described. The algorithm will work for small graphs. Performance results for some well-known graphs will be presented.