An FPT 2-approximation for tree-cut decomposition
The tree-cut width of a graph is a graph parameter defined by Wollan (J Combin Theory, Ser
B, 110: 47–66, 2015) with the help of tree-cut decompositions. In certain cases, tree-cut …
B, 110: 47–66, 2015) with the help of tree-cut decompositions. In certain cases, tree-cut …
Pure Nash equilibria in graphical games and treewidth
A Thomas, J van Leeuwen - Algorithmica, 2015 - Springer
We treat PNE-GG, the problem of deciding the existence of a Pure Nash Equilibrium in a
graphical game, and the role of treewidth in this problem. PNE-GG is known to be NP NP …
graphical game, and the role of treewidth in this problem. PNE-GG is known to be NP NP …