SluitenHelpPrint
Switch to English
Cursus: 202001363
202001363
Implementation Project on Graph Isomorphism
Cursus informatie
Cursus202001363
Studiepunten (ECTS)3
CursustypeOnderwijseenheid
VoertaalEngels
Contactpersoondr. R.P. Hoeksma
E-mailr.p.hoeksma@utwente.nl
Docenten
VorigeVolgende 1
Tutor
dr. F. Ahmed
Contactpersoon van de cursus
dr. R.P. Hoeksma
Examinator
dr. R.P. Hoeksma
Docent
dr. B. Manthey
Docent
dr. A. Skopalik
Collegejaar2020
Aanvangsblok
2A
AanmeldingsprocedureZelf aanmelden via OSIRIS Student
Inschrijven via OSIRISJa
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
Before participating in this project the student should have some experience with programming (in any programming language or, e.g., MATLAB).
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 study units earlier. Exceptions are possible for students 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
Hoorcollege
AanwezigheidsplichtJa

Opdracht
AanwezigheidsplichtJa

Practicum
AanwezigheidsplichtJa

Project begeleid
AanwezigheidsplichtJa

Project onbegeleid
AanwezigheidsplichtJa

Toetsen
Graph-Isomorphism Algor. Implementation

SluitenHelpPrint
Switch to English