Friday, March 20, 2009

Friday, March 20, 2009 — 3:30 PM to 4:30 PM EDT

Increasing connectivity of a graph from 1 to 2

Speaker: Guy Kortsarz Affiliation: Rutgers University Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given an unweighted graph G(V,E) and a set F\subseteq V\times V the goal is to find a minimum SIZE F'\subset F such that G(V,E+F') is 2 edge-connected, namely, every edge lies in a cycle in G(V,E+F'). 

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
  1. 2021 (102)
    1. December (2)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  2. 2020 (119)
    1. December (5)
    2. November (12)
    3. October (12)
    4. September (12)
    5. August (11)
    6. July (17)
    7. June (11)
    8. May (6)
    9. March (11)
    10. February (11)
    11. January (11)
  3. 2019 (167)
  4. 2018 (136)
  5. 2017 (103)
  6. 2016 (137)
  7. 2015 (136)
  8. 2014 (88)
  9. 2013 (48)
  10. 2012 (39)
  11. 2011 (36)
  12. 2010 (40)
  13. 2009 (40)
    1. December (2)
    2. November (3)
    3. October (5)
    4. September (2)
    5. August (2)
    6. July (6)
    7. June (3)
    8. May (4)
    9. April (2)
    10. March (4)
    11. February (4)
    12. January (3)
  14. 2008 (39)
  15. 2007 (15)