February 11, 2015
4:10 pm
-
5:10 pm
CH 240
Add to Calendar
2015-02-11 17:10:00
2015-02-11 18:10:00
Algorithmic Topological Graph Theory
Speaker: Anastasios Sidiropoulos (OSU)Abstract: Graphs can be used to model a plethora of objects and natural phenomena.Algorithmic graph theory seeks to design efficient procedures for computing or approximating various graph invariants, such as the chromatic number, crossing number, genus, expansion, and so on. This series of lectures will focus on algorithmic problems that arise in topological graph theory. Most of the graph invariants in this context are known to be hard to compute exactly. We will discuss various approaches for overcoming this computational barrier.Note: Pre-candidacy students can sign up for this lecture series by registering for one or two credit hours of Math 6193, Call/Class # 20913 (with Prof H. Moscovici).
CH 240
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
2015-02-11 16:10:00
2015-02-11 17:10:00
Algorithmic Topological Graph Theory
Speaker: Anastasios Sidiropoulos (OSU)Abstract: Graphs can be used to model a plethora of objects and natural phenomena.Algorithmic graph theory seeks to design efficient procedures for computing or approximating various graph invariants, such as the chromatic number, crossing number, genus, expansion, and so on. This series of lectures will focus on algorithmic problems that arise in topological graph theory. Most of the graph invariants in this context are known to be hard to compute exactly. We will discuss various approaches for overcoming this computational barrier.Note: Pre-candidacy students can sign up for this lecture series by registering for one or two credit hours of Math 6193, Call/Class # 20913 (with Prof H. Moscovici).
CH 240
America/New_York
public
Speaker: Anastasios Sidiropoulos (OSU)
Abstract:
Graphs can be used to model a plethora of objects and natural phenomena.
Algorithmic graph theory seeks to design efficient procedures for computing or approximating various graph invariants, such as the chromatic number, crossing number, genus, expansion, and so on. This series of lectures will focus on algorithmic problems that arise in topological graph theory. Most of the graph invariants in this context are known to be hard to compute exactly. We will discuss various approaches for overcoming this computational barrier.
Note: Pre-candidacy students can sign up for this lecture series by registering for one or two credit hours of Math 6193, Call/Class # 20913 (with Prof H. Moscovici).
