-
We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class
35 events found.
Virtual Discrete Math Colloquium
Calendar of Events
|
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Random walks and spectral methods have had a strong influence on modern graph algorithms as evidenced by the extensive literature on the subject. In this talk, I will present how random walks helped make progress on algorithmic problems on planar graphs. In particular, I show how random walk based (i.e., spectral) approaches led to progress … |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
A conjecture of Milena Mihail and Umesh Vazirani states that the edge expansion of the graph of every |
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
I will present the short proof from that for every digraph F and every assignment of pairs of integers |
0 events,
|
0 events,
|
0 events,
|