Campus Event Calendar
Event Entry
New for: D1, D2, D3, D4
What and Who
Representing all minimum cuts of a graph
Friedrich Eisenbrand
Seminar des Graduiertenkollegs
AG 1, AG 2, AG 3, AG 4
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 3 May 99
16:00
-- Not specified --
45 - FB14
015
Saarbrücken
Abstract
This problem recently gained a lot of interest in the context of
cutting planes for the Subtour Elimination Polytope, a common
relaxation of the Traveling Salesman Polytope.
In this talk I will explain the cactus representation [Dinitz 76] of
all minimum cuts of a graph.
In this talk I will explain the cactus representation [Dinitz 76] of
all minimum cuts of a graph.
Contact
--email hidden
passcode not visible
logged in users only