TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)Seminar: Graph Exploration

COGA 5-Wheel

Page Content

to Navigation

There is no English translation for this web page.

Seminar on Graph Exploration

Imagine you are lost in an unknown graph (imagine a non-planar labyrinth where all intersections look exactly the same) and are looking for a way out. Can you always systematically find a way out? Does it help to bring a group of friends? How many of your past decisions do you need to remember? Would a compass or bread crumbs help?

Graph exploration deals with these and other problems. The challenge is to develop efficient algorithms that systematically "learn" the topology of the graph. In the seminar we study the state of the art and limitation of exploration algorithms in the literature.

Prerequisites

The purpose of this seminar is to read and understand recent results from the literature on graph exploration. Participants are expected to have some experience with the analysis of advanced algorithms (e.g. from an ADM III).

Course Material (german)

Leitfaden

Themenliste

Zusammenfassungs-Template (pdf, tex)

Important dates

A preparatory meeting where possible seminar topics etc. are presented took place on October 20, 2015, 11:15, in room MA 313.

A second preparatory meeting where general guidelines are discussed will take place on January 12, 2016, 14:15, in room MA 313.

Each participant will give a 5-minute introductory presentation on January 26, 2016, 14:15, in room EB 133C.

The presentation slides have to be handed in before February 12, 2016 for a final check.

The seminar will be held as a block seminar on March 1&2, 2016, 10:00-19:00 in MA 143.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe