Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Thursday, November 15, 2012, 12:15 pm
Duration: 30 minutes
Location: HG D5.2
Speaker: Ueli Peter
A class of graphs is separable if it is closed under the subgraph relation and if every member with n vertices has a separator of size O(nc) for some c < 1. In in this talk we discuss a data structure by Blandford, Blelloch and Kash which is able to store separable graphs using O(n) bits. This generalizes a result by Turan which states that planar graphs can be stored using O(n) bits.
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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
