This project was made for an exam for the lesson Applied Combinatorics, in University of Piraeus IT department. The language used is Python 3. A detailed presentation of the algorithms of this repository is provided. You can easily navigate by using the table of contents below.
To better understand the purpose of the code, make sure you are familiar with Graph theory in general.
- Python 3
- matplotlib
- networkx
- Generating a random undirected graph
- Finding all the Cliques of an undirected graph with Backtracking
- Estimating the size of the Backtracking Tree
- https://www.site.uottawa.ca/~lucia/courses/5165-10/Backtracking.pdf
- https://www.researchgate.net/publication/221605776_Estimating_Search_Tree_Size
I am far from the best in Python. Any useful and productive comments are welcome!