Zoom Logo

EVOP MS-11 - Shared screen with speaker view
mike steel
47:30
What is the complexity of Network-PD on level-1 networks?
Vincent Moulton
47:37
Hi Magnus - can you say anything about level-2?
Vincent Moulton
49:17
ok - thanks
Vincent Moulton
01:09:23
what about preserving clusters?
mike steel
01:10:54
Is the problem also hard for tree-based networks?
steven kelk
01:27:40
I can't remember but do GSP graphs have bounded treewidth? (SP graphs certainly have treewidth 2.) If edge-based networks are similar to GSP graphs, and thus have extremely low treewidth, does this help us to solve all kinds of problems on these networks that are normally NP-hard?
steven kelk
01:28:40
bounded treewidth usually yields really fast algorithms :-) thanks for the answer!
steven kelk
01:31:43
(Comment: I guess splits graphs quickly contain large grids as minors and thus have unbounded treewidth)
Magnus Bordewich
01:31:58
q