Sciweavers

20 search results - page 4 / 4
» Game List Colouring of Graphs
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
AGTIVE
2007
Springer
14 years 4 months ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe
FOCS
2009
IEEE
14 years 4 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
WG
2005
Springer
14 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr