Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Thursday, August 27, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Gerald Weber (University of Auckland)

Total order is not always best - notes on topological sorting

Topological sorting as an algorithmic problem is often stated as only defined for acyclic graphs, and phrased as finding a total order consistent with a directed graph. I will argue that in several applications in software engineering, cycle detection is so closely intertwined with topological sorting, that a combined algorithm is considerably more useful. Also the so-called stratification of the vertices is at least as important, if not more important, as output of the sorting process. In any case, the stratification has important additional information about the graph, if compared to a total ordering. I will also bring in impressions from a teaching perspective and argue that a more general problem may sometimes be easier to grasp than a narrow problem.

Bio: Gerald Weber is Senior Lecturer in the Department of Computer Science at the University of Auckland. He joined the department in 2003. His research Interests are human centric information systems and models Gerald holds a PhD from the Free University Berlin. He is information director of the Proceedings of the VLDB Endowment and has been program chair of several conferences in Enterprise Systems and Human-Computer Interaction.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login