192 search results - page 23 / 39 » On Graph Isomorphism for Restricted Graph Classes |
115
click to vote
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
113
click to vote
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
101
click to vote
UAI
2008
15 years 1 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
109
click to vote
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...