Campus Event Calendar: Nina Taslaman (02/28/2012 in E1 4/024)

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

Shortest Cycle Through Specified Elements

Nina Taslaman

ITU Copenhagen

Lecture

AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI

AG Audience

English

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

Date, Time and Location

Tuesday, 28 February 2012

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

We give a randomized algorithm that finds a shortest simple cycle through a given set of k vertices or edges in an n-vertex undirected graph in time 2^k poly(n).

Contact

Danny Hermelin

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Danny Hermelin, 02/24/2012 13:43 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis