Sciweavers

356 search results - page 39 / 72
» Graph Games on Ordinals
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Games with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
Olivier Serre
ISCAPDCS
2004
14 years 11 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
TCS
2008
14 years 9 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
ICALP
2009
Springer
15 years 10 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
APVIS
2004
14 years 11 months ago
Graph Interaction through Force-Based Skeletal Animation
Skeletal animation is a concept that has been used in the areas of motion pictures and computer games to create realistic motion for the animation of articulated characters. Recen...
Colin Murray, Damian Merrick, Masahiro Takatsuka