THIS SITE

Information for

Events

Thursday, September 14, 2017

Thursday, September 14, 2017 — 3:30 PM EDT

Title: Using eigenvalues to bound the independence number of a graph

Speaker: John  Sinkovic Affiliation: University of Waterloo Location: MC 6486

Abstract:

Finding a maximum independent set (or clique) in an arbitrary graph has been shown to be NP-hard.  As any independent set gives a lower bound on the independence number, determining an upper bound is usually more useful. 

Thursday, September 14, 2017 — 3:30 PM EDT

Title: Geometric drawings of graphs (Part I)

Speaker: Alan Arroyo Affiliation: University of Waterloo Room: MC 5479

Abstract:

This is the first of two talks about drawings of graphs that arise from geometry.

Part I: Understanding rectilinear drawings.

S M T W T F S
27
28
29
30
31
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
  1. 2017 (69)
    1. September (7)
    2. August (3)
    3. July (5)
    4. June (9)
    5. May (10)
    6. April (7)
    7. March (13)
    8. February (10)
    9. January (5)
  2. 2016 (137)
    1. December (5)
    2. November (12)
    3. October (10)
    4. September (8)
    5. August (12)
    6. July (15)
    7. June (14)
    8. May (16)
    9. April (8)
    10. March (18)
    11. February (11)
    12. January (8)
  3. 2015 (136)
  4. 2014 (88)
  5. 2013 (48)
  6. 2012 (39)
  7. 2011 (36)
  8. 2010 (40)
  9. 2009 (40)
  10. 2008 (39)
  11. 2007 (15)