17. SEG-Workshop u¨ber Kombinatorik, Graphentheorie und Algorithmen Hochschule Mittweida, Haus 1, Raum 1-229D 2. Juni 2015 Programm 15:00 – 15:30 Carol Zamfirescu (TU Dortmund): A cut locus for finite graphs and the farthest point mapping 15:30 – 16:00 Thomas Lange (Hochschule Mittweida): Reliability of highly symmetrical graphs under connectivity requirements 16:00 – 16:30 Uwe Schwerdtfeger (TU Chemnitz): Optimal embeddings of trees in the line 16:30 – 17:00 Kaffeepause 17:00 – 17:30 Margit Voigt (HTW Dresden): (a; b)-list colorings 17:30 – 18:00 Markus Dod (Hochschule Mittweida): PyGraphEdit - A user-friendly graph editor 18:00 – 18:30 Ingo Schiermeyer (TU Bergakademie Freiberg): Rainbow connection and size of graphs 19:00 – ∞ Gemeinsames Abendessen im Deutschen Haus 1
© Copyright 2024 ExpyDoc