Partial symmetries of graphs
Bachelor thesis, Michal Slávik
Fakulta matematiky, fyziky a informatiky - Univerzita Komenského, Bratislava
Diary
19.4.2021 - 25.4.2021
- Implementing algorithms for partial symmetries of graphs
- Writing implementation part of thesis
12.4.2021 - 18.4.2021
- Adding algorithms for tree symmetries
- Refactoring source code
- Improving algorithm for graph isomorphism
- Evaluating current stage of thesis with supervisor
5.4.2021 - 11.4.2021
- Discussing current stage of the work with supervisor, clarification of goals
- Studying symmetries of trees and stars
- Adding algorithms for stars
29.3.2021 - 4.4.2021
- Adding algorithms for partial symmetries of graphs
22.3.2021 - 28.3.2021
- Adding algorithms for graph isomorphism
- Refactoring source code
- Discussing algorithms for graph isomorphism with supervisor
15.3.2021 - 21.3.2021
- Adding algorithms for trees to source code
- Optimizing algorithm for counting graph symmetries
- Studying partial symmetries
8.3.2021 - 14.3.2021
- Studying symmetries of stars and trees
- Adding new algorithms for stars to source code
- Refactoring source code
- Studying definitions of patial symmetries of graphs with supervisor
1.3.2021 - 7.3.2021
- Rewriting code to Kotlin programming language
- Publishing source code to GitHub
- Discussing the goals of work and next steps with supervisor
- Adding tests
22.2.2021 - 28.2.2021
- Website update (sources, diary)
- Studying the main source work
- Working on an algorithm for finding all induced subgraphs of a graph
15.2.2021 - 21.2.2021
- Clarification of objectives and uncertainties with supervisor
- Studying the main source work
- Slight changes of the source code