Sluiten Help Print Cursus: 202001363 202001363 Implementation Project on Graph Isomorphism Cursus informatie Cursus 202001363 Studiepunten (ECTS) 3 Cursustype Onderwijseenheid Voertaal Engels Contactpersoon dr. R.P. Hoeksma E-mail r.p.hoeksma@utwente.nl Docenten Vorige 1-5 van 66-6 van 6 Volgende 1 Docent dr. F. Ahmed Docent dr. G. Caltais Docent K.W. Fokkema Contactpersoon van de cursus dr. R.P. Hoeksma Examinator dr. R.P. Hoeksma Collegejaar 2022 Aanvangsblok 2A Opmerking Part of module 7 AM/TCS. Minor students: please register for the minor! Aanmeldingsprocedure Zelf aanmelden via OSIRIS Student Inschrijven via OSIRIS Ja Cursusdoelen 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. Inhoud 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. Voorkennis 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. Participating study Bachelor Applied Mathematics Participating study Bachelor Technical Computer Science Module Module 7 Verplicht materiaal Handouts Lecture slides Aanbevolen materiaal - Werkvormen Colstructie Aanwezigheidsplicht Ja Hoorcollege Aanwezigheidsplicht Ja Opdracht Aanwezigheidsplicht Ja Practicum Aanwezigheidsplicht Ja Project begeleid Aanwezigheidsplicht Ja Project onbegeleid Aanwezigheidsplicht Ja Toetsen Graph-Isomorphism Algor. Implementation Sluiten Help Print