Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

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

Mittagsseminar Talk Information

Date and Time: Tuesday, October 01, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Torsten Mütze

Binary Decision Diagrams - A general-purpose toolkit for combinatorial problems

A binary decision diagram, BDD for short, is a data structure to represent a boolean function. In this talk I will discuss the amazing possibilities BDDs offer to solve the three most fundamental combinatorial problems:
- counting all objects from a family X
- generating uniformly random elements from X
- computing weighted maxima/minima over all elements in X
Here X is some family of combinatorial objects, e.g. all independent sets, matchings, colorings, spanning trees or Hamilton paths/cycles of a graph (choose your favourite). Based on material from [D. Knuth, The Art of Computer Programming, Vol. 4], I will introduce the main techniques to do combinatorics with BDDs and illustrate them with various examples.

Personal note: I got to know BDDs in the context of Boolean circuit verification, and when I learned about their applications in combinatorics from Knuth's book, I realized that this topic deserves to be much better known.

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