FAG3103 Network Analysis 7.5 credits

Nätverksanalys

Through reading assignments, lectures, seminars, and laboratory exercises, this course introduces doctoral students to what network or graph-theoretic algorithms are relevant to users of geographic information systems (GIS), how they are implemented in existing GIS, and how and what other algorithms should be incorporated in future GIS. Practical examples will be given to motivate the use of GIS for network analysis and the needs of efficient computational procedures for solving relevant problems.

Offering and execution

Course offering missing for current semester as well as for previous and coming semesters

Course information

Content and learning outcomes

Course contents *

The course begins with the review of the capabilities of existing GIS, and then focuses on how to formulate relevant paths and flow problems, i.e., the shortest path problem, the maximum flow problem, and the minimum cost flow problem, and how to solve them algorithmically. Examples will be introduced and discussed in terms of their applications, complexities, and possible solution methods.

Intended learning outcomes *

Through reading assignments, lectures, seminars, and laboratory exercises, this course introduces doctoral students to what network or graph-theoretic algorithms are relevant to users of geographic information systems (GIS), how they are implemented in existing GIS, and how and what other algorithms should be incorporated in future GIS. Practical examples will be given to motivate the use of GIS for network analysis and the needs of efficient computational procedures for solving relevant problems.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

A masters degree in geoinformatics, computer science, operations research, or relevant science and engineering fields. Documented proficiency in English B or equivalent.

Recommended prerequisites

A masters degree in geoinformatics, computer science, operations research, or relevant science and engineering fields. Documented proficiency in English B or equivalent.

Equipment

No information inserted

Literature

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, Network Flows: Theory, Algorithms, and Applications by, Prentice Hall, 1993.


Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, Network Flows: Theory, Algorithms, and Applications by, Prentice Hall, 1993.

Examination and completion

Grading scale *

P, F

Examination *

  • PRO1 - Project assignment, 7.5 credits, Grading scale: P, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Takeshi Shirabe

Further information

Course web

No information inserted

Offered by

ABE/Geoinformatics

Main field of study *

No information inserted

Education cycle *

Third cycle

Add-on studies

No information inserted

Contact

Takeshi Shirabe 08-7906363 shirabe@th.se

Ethical approach *

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Postgraduate course

Postgraduate courses at ABE/Geoinformatics