Results 231 to 239 of about 4,791 (239)
Some of the next articles are maybe not open access.
Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics, 1994It is shown that the treewidth of circular-arc graphs and the corresponding tree-decomposition can be found in \(O(n^ 3)\) time. Let \(G= (V,E)\) be a circular-arc graph corresponding to a family \(\{A_ 0, A_ 1,\dots, A_{n-1}\}\) of arcs on a unit circle. Define a left clique \(S_ i\) by \(S_ i= \{A_ j\mid A_ j\) contains the left end points of \(A_ i\}
Sundaram, Ravi +2 more
openaire +2 more sources
Approximation Algorithms for Treewidth
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Treewidth and Pure Nash Equilibria
2013We consider the complexity of w-PNE-GG, the problem of computing pure Nash equilibria in graphical games parameterized by the treewidth w of the underlying graph. It is well-known that the problem of computing pure Nash equilibria is NP-hard in general, but in polynomial time when restricted to games of bounded treewidth.
Thomas, A., van Leeuwen, J.
openaire +2 more sources