Campus Event Calendar
Event Entry
What and Who
Cycle Bases and Applications
Dimitrios Michail
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 24 November 2005
13:00
-- Not specified --
45 - FR 6.2 (E1 3)
016
Saarbrücken
Abstract
In this work we consider the problem of computing a minimum cycle
basis of a weighted undirected graph. We present the basic techniques
used in order to solve this problem, the fastest algorithms and
various heuristics for speeding up in practice. Finally, we briefly
discuss some applications of the minimum cycle basis problem.
basis of a weighted undirected graph. We present the basic techniques
used in order to solve this problem, the fastest algorithms and
various heuristics for speeding up in practice. Finally, we briefly
discuss some applications of the minimum cycle basis problem.
Contact
--email hidden
passcode not visible
logged in users only
Veronika Weinand, 11/21/2005 13:32
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.