Who can see your viewing activity?
What is the complexity of Network-PD on level-1 networks?
Hi Magnus - can you say anything about level-2?
ok - thanks
what about preserving clusters?
Is the problem also hard for tree-based networks?
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?
bounded treewidth usually yields really fast algorithms :-) thanks for the answer!
(Comment: I guess splits graphs quickly contain large grids as minors and thus have unbounded treewidth)