| Talking persons: |
| Tobias Brunsch |
| Abstract: |
| Zweifärbbarkeit ist ein Problem der Graphentheorie, für das Linearzeitalgorithmen bekannt sind. Erstaunlicherweise lässt sich sogar ein O(1)-Algorithmus angeben, wenn man das Problem etwas abschwächt. Wir werden einen solchen Algorithmus anschauen und analysieren. |
| Times: |
| Monday 17th November 2008, 5.15 pm - 6.45 pm, room 1/B006 |
Chemnitz University of Technology receives a "StudyCheck Award 2024" and the "Top University 2024" certificate thanks to the very positive evaluations from its students and alumni – Additionally, Chemnitz University of Technology is the top state university in the live "Digital Readiness" ranking …
Researchers at TU Chemnitz and LMU Munich have developed a chatbot that can be used to learn more about the Holocaust – the interactive online testimony of Abba Naor enables users to have individual digital conversations with a Holocaust survivor in English …
From April 23 on, the University Library presents “book gems“ of its „Historical Collections“ within an exhibition and on the occasion of the TUCday at April 27, 2024 …
Health Day invites you to useful health tips and fun interactive activities. There will be …
The Graduation Celebration is one of the most beloved traditions at the TU Chemnitz. Brand new …
Dancing and good vibes until midnight: Various music and culinary offerings create a relaxed …
The lecture is mainly about mathematics during the National Socialist era: …
New students are greeted each year at the beginning of the winter semester in a cherished …
Get with us in the mood of Christmas with our festive program for young and old alike.
