Petr Hliněný: Advanced Graph Theory II

Better see my NEW PAGES,

hurry, or you miss it...

MA052:	Advanced Graph Theory II	2011
doc. RNDr. Petr Hliněný, Ph.D. (KTP FI MU)	Advanced Graph Theory II
lecture 2, class exercises 1, select another -, eng angličtina	zk zkouška ( z )
Hours: The jaro 2011 timetable will be released on Po 14. 2. 2011
	News
*Course objectives.* The purpose of this subject is to introduce students to the area of structural graph theory and its applications. Basic principles underlying this theory and algorithmic applications are surveyed. A prominent role is given to "width" parameters of graphs, like tree-width or branch-width or rank-width. In this course the students will learn about some cutting-edge recent development in graph theory. At the end, they should: understand the basic principles of structural graph theory and of graph minors including algorithmic applications; and be able to continue with some scientific work in this area if they choose to.
*Prerequisites.* Graph theory MA010. Some knowledge of algorithmic complexity and of predicate logic is welcome.
*Course organization.* This is an advanced theoretical course, taught in English, and conducted quite informally (a seminar-type lecturing). Students are expected to actively participate in all the lectures and tutorials. Evaluation is based on a mandatory written individual homework assignment (one essay), and on a subsequent oral exam.
*Teacher's information.* Free online access to the course book: Diestel, Reinhard. Graph theory. "http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/". Supplementary literature (partly in Czech): Petr Hliněný. Teorie grafů / Graph theory, "http://www.fi.muni.cz/~hlineny/Vyuka/GT/".

MA052:

Advanced Graph Theory II

2011

doc. RNDr. Petr Hliněný, Ph.D. (KTP FI MU)

Advanced Graph Theory II

lecture 2, class exercises 1, select another -, eng angličtina

zk zkouška ( z )

Hours: The jaro 2011 timetable will be released on Po 14. 2. 2011

News

Course objectives. The purpose of this subject is to introduce students to the area of structural graph theory and its applications. Basic principles underlying this theory and algorithmic applications are surveyed. A prominent role is given to "width" parameters of graphs, like tree-width or branch-width or rank-width.
In this course the students will learn about some cutting-edge recent development in graph theory. At the end, they should: understand the basic principles of structural graph theory and of graph minors including algorithmic applications; and be able to continue with some scientific work in this area if they choose to.

Prerequisites. Graph theory MA010. Some knowledge of algorithmic complexity and of predicate logic is welcome.

Course organization. This is an advanced theoretical course, taught in English, and conducted quite informally (a seminar-type lecturing). Students are expected to actively participate in all the lectures and tutorials.

Evaluation is based on a mandatory written individual homework assignment (one essay), and on a subsequent oral exam.

Teacher's information. Free online access to the course book: Diestel, Reinhard. Graph theory. "http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/". Supplementary literature (partly in Czech): Petr Hliněný. Teorie grafů / Graph theory, "http://www.fi.muni.cz/~hlineny/Vyuka/GT/".

Short informal course notes.

Reinhard Diestel. Graph Theory, third edition, online. Springer-Verlag, Heidelberg, Graduate Texts in Mathematics, Volume 173.

J.F. Geelen, A.M.H. Gerards, and G. Whittle, Branch width and well-quasiordering in matroids and graphs, online. Journal of Combinatorial Theory B 84 (2002), 270-290.

P. Hliněný, S. Oum, D. Seese, G. Gottlob, Width Parameters Beyond Tree-width and Their Applications, preprint. Computer Journal 51 (2008), 326-362.

Actual news

[full html][entry]	Advanced Graph Theory II	Petr Hliněný FI MU Brno, CZ
(Petr Hliněný) Actual and supplementary teacher's information about the subject Advanced Graph Theory II at FI MU Brno, CZ. Students should read them regularly...		13 September 2008