Campus Event Calendar: Kurt Mehlhorn (02/08/2002 in 46.1

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Convincing Graph Recognition Algorithms

Kurt Mehlhorn

Max-Planck-Institut für Informatik - AG 1

AG1 Mittagsseminar (own work)

AG 1, AG 2, AG 3, AG 4

MPI Audience

-- Not specified --

Note: We use this to send email in the morning.

Date, Time and Location

Friday, 8 February 2002

13:30

30 Minutes

46.1 - MPII

024

Saarbrücken

Abstract

I discuss convincing graph recognition algorithms in general and

a new concincing linear time recognition algorithm for interval graphs
in particular (joint work with Dieter Kratsch, Ross McConnel, and
Jeremy Spinrad). A recognition algorithm is convincing if it not
only solves the recognition problem at hand but also produces
witnesses of membership and non-membership.

Contact

Kurt Mehlhorn

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis