BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20131027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20140330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.6757.field_data.0@www.u-gov-ricerca.uniroma1.it
DTSTAMP:20260405T115708Z
CREATED:20131104T043803Z
DESCRIPTION:Title: Algebraic Algorithms for b-Matching\, Shortest Undirecte
 d Paths\, and f-Factors. Abstract:Let G=(V\,E) be a graph with degree boun
 ds on vertices. We present the first efficient algebraic algorithm to find
  an f-factor.  The algorithms are randomized\, correct with high probabili
 ty and Las Vegas.  We also present three specializations of these algorith
 ms:- For maximum weight perfect f-matching the algorithm is considerably s
 impler (and almost identical to its special case of ordinary weighted matc
 hing). - For the single-source shortest-path problem in undirected graphs 
 with conservative edge weights\, we present a generalization of the shorte
 st-path tree. - For bipartite graphs\, we improve the known complexity bou
 nds for vertex capacitated  max-flow and min-cost max-flow on a subclass o
 f graphs. Joint work with Harold N. Gabow.   
DTSTART;TZID=Europe/Paris:20131106T120000
DTEND;TZID=Europe/Paris:20131106T120000
LAST-MODIFIED:20131105T114513Z
LOCATION:DIAG - Via Ariosto 25\, Aula Magna
SUMMARY:Piotr Sankowski (University of Warsaw):  Algebraic Algorithms for b
 -Matching\, Shortest Undirected Paths\, and f-Factors - Piotr Sankowski
URL;TYPE=URI:http://www.u-gov-ricerca.uniroma1.it/node/6757
END:VEVENT
END:VCALENDAR