Open University

Pori

Tampere

Algorithms for Graphs, Online teaching

Contact information Email: open.studies.tau [at] tuni.fi Phone: 0294 520 200More information concerning Open University studies <a href="https://www.tuni.fi/open-university">tuni.fi/open-university</a>

Intermediate studies

Faculty of Information Technology and Communication Sciences

Technology and Natural Sciences

Apply for Open University studies by using the following links:<ul><li><a href="https://tau-avoin.ilmoittaudu.fi/lobby/?realization=J-otm-b1a2abfe-7644-4ca8-bb16-f90aa7a6fc0f_2023-tampere-MATHAPP270" target="_blank">MATH.APP.270 Algorithms for Graphs, online teaching, Tampere</a></li><li><a href="https://tau-avoin.ilmoittaudu.fi/lobby/?realization=J-otm-b1a2abfe-7644-4ca8-bb16-f90aa7a6fc0f_2023-pori-MATHAPP270" target="_blank">MATH.APP.270 Algorithms for Graphs, online teaching, Pori</a></li></ul>You can find a link to the Open University Admissions service and application instructions on the <a href="https://www.tuni.fi/en/study-with-us/open-higher-education-studies/open-university/applying-open-university">Applying to Open University studies</a> page.Some of the studies require prior studies. For example, studying intermediate studies may require some completed basic studies. These are described on the Information about studies tab of the study unit under prior requirements.When you have been admitted to the studies, you must enrol separately via the Sisu information system for the implementation of the unit of study and, for example if set, for a practise group of your choice. You will receive instructions on how to do this by e-mail after you have confirmed your acceptance of the study place by paying the required fee.

English

Hervanta Campus

Online studies

Look information at <a href="https://www.tuni.fi/en/study-with-us/open-higher-education-studies/open-university/applying-open-university">Applying to Open University studies</a>.

<ul><li>Basics of graph theory (paths, components, cuts) </li><li>Trees (root, parets, leaves, spanning trees) </li><li>Binary relations ( closures, order relations and related algorithms)</li><li>Proving algorithm correctness (loop invariants and induction)</li><li>Problem modeling with graphs (shortest path, flow problems, etc) </li><li>Graph and tree presentations (adjacency matrix, adjacency lists, etc) </li></ul>

The student is able to verify properties of relations and utilize these properties in analysis of information represented as graphs. For example, the student is able to define different relations using graph theory concepts. For a given graph the student can identify the components, paths, cuts, spanning trees etc. The student can use algorithms for identifying components, paths, etc. The student is able to recognize some common problems as graph problems and understands the basics of the algorithms that solve these problems. For example, shortest paths or minimal spanning tree. The student understands how to prove the correctness of an algorithm via induction and loop invariants.

Finnish

Algorithmic Graph Theory and Sage; Tekijät:  David Joyner, Minh Van Nguyen, David Phillips

<h2>Compulsory Prerequisites</h2><ul><li>Vectors and Matrices, MATH.MA.140, 5 cr</li></ul><h2>Recommended Prerequisites</h2><ul><li>Discrete Mathematics, MATH.MA.210, 5 cr</li><li>Programming 1: Introduction to Programming, COMP.CS.100, 5 cr</li></ul>

<ul><li>AYCSMSCVO Open University Route, Computing Sciences, MSc. Tech.</li><li>AYEEMSCVO Open University Route, Electrical Engineering, MSc. Tech.</li><li>AYITMSCVO Open University Route, Information Technology, MSc. Tech.</li></ul>

Details can be found on the Moodle page.

Algorithms for Graphs, Online teaching

Extent

Course dates

Application period

Fees

Campus

City

Faculty or school

Language of instruction

Code

Study fields

Mode of study

Study level

Algorithms for Graphs, 5 cr

Contact information

How to apply

Payment terms

Give us feedback!

Your last viewed study options

Algorithms for Graphs, Online teaching