Close Help Print Course module: 202001363 202001363 Implementation Project on Graph Isomorphism Course info Course module 202001363 Credits (ECTS) 3 Course type Study Unit Language of instruction English Contact person dr. R.P. Hoeksma E-mail r.p.hoeksma@utwente.nl Lecturer(s) Previous 1-5 of 66-6 of 6 Next 1 Lecturer dr. F. Ahmed Lecturer K.W. Fokkema Lecturer dr. M. Gerhold Examiner dr. R.P. Hoeksma Contactperson for the course dr. R.P. Hoeksma Academic year 2021 Starting block 2A Remarks Minor students: register for the minor! Application procedure You apply via OSIRIS Student Registration using OSIRIS Yes Aims After following this course the student: is able to translate mathematical concepts into algorithms and implement them into a (Python) program; is able to choose the right data structure(s) for the practical implementation of algorithms; can work in a group on an implementation project that has multiple modular parts; can document the computation results obtained with (different versions of) the implementation of an algorithm. Content In this project, students implement an algorithm for solving the notorious graph isomorphism (and graph automorphism counting) problem.   This can be accomplished on various levels of mathematical complexity, and nicely connects to all of the topics that are treated in the module. The implementation project ends with a sort of “competition" in which students test the capability of their own implementation on a set of benchmark instances of increasing difficulty.   Assumed previous knowledge The student should be able to do basic programming in Python. Self-study material will be provided for students who do not have the necessary Python knowledge. As this project integrates material from the courses Algorithmic Discrete Mathematics, Languages & Machines and Algebra, participation is conditional on students that are also enrolled in the other study units of the module, or have successfully completed these earlier. Exceptions are possible with equivalent prior knowledge. Module Module 7 Participating study Bachelor Applied Mathematics Participating study Required materials Handouts Lecture slides Recommended materials - Instructional modes Assignment Presence duty Yes Lectorial Presence duty Yes Lecture Presence duty Yes Practical Presence duty Yes Project supervised Presence duty Yes Project unsupervised Presence duty Yes Tests Graph-Isomorphism Algor. Implementation Close Help Print