|Universität Tübingen||Fakultät > Wilhelm-Schickard-Institut > Paralleles Rechnen > Workshop on Cycle Bases|
Arbeitsbereich Paralleles Rechnen
Workshop on Cycle and Cut Bases
Although cycle bases were already introduced by Kirchhoff, the mathematics to analyze and the algorithms to compute them are still hot topics. A related but different topic are so-called cut bases of graphs that denote a nearly unknown territory. Together with Christian Liebchen (TU Berlin) and Horst Hamacher (Kaiserslautern) we thus invite you to this workshop to work on open problems in both realms and to find out where the similarities and differences between cycle and cut bases are. The workshop is organized within the framework of the SPP 1126 (Algorithmik großer und komplexer Netzwerke).
This workshop will be a meeting point for those groups and scientists that have already worked on either topic. We will meet on Wednesday, the 14th of May, 2008, 16:30h and use the first evening to present some open problems in the realm of the two topics. The plan is that the organizers will provide three open problems and that we will additionally accept one or two open problems from other participants. The next two days of the workshop are dedicated to work on the open problems. The results obtained so far will then be summarized on Friday, the 16th of May 2008.
We have not definitely decided which kind of open problems we will work on, but here are some possibilities:
The group should not be larger than 20 people to make the workshop efficient. We will thus accept applications on a first-come-first-serve manner.
|Anregungen / Kritik Impressum|