Smart Clique Identification in Graphs, and Application to Overlap Detection for Decision Tables
Organization
Algorithms & Theory
Abstract
This is a proof-oriented algorithm topic. It deals with the following problem: Given as input a graph G, find the edge e of G which is contained in the largest number of large cliques (details will be made precise). The application of this problem lies in human user interaction when debugging decision tables: the algorithm gives the most problematic "bug".
After a literature review, the complexity (NP? hardness?) has to be addressed. Then approximation algorithms should be studied. If the search for a good algorithm is successful, it is an option to code that algorithm in C/C++.
After a literature review, the complexity (NP? hardness?) has to be addressed. Then approximation algorithms should be studied. If the search for a good algorithm is successful, it is an option to code that algorithm in C/C++.
Graduation Theses defence year
2016-2017
Supervisor
Dirk Oliver Theis
Spoken language (s)
English
Requirements for candidates
Brains. Analysis of algorithms.
Level
Masters
Keywords
Application of contact
Name
Dirk Oliver theis
Phone
E-mail