Sciweavers

2322 search results - page 61 / 465
» On a game in directed graphs
Sort
View
ICC
2007
IEEE
101views Communications» more  ICC 2007»
16 years 14 days ago
Transmission Scheduling in Sensor Networks via Directed Edge Coloring
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
Maggie X. Cheng, Li Yin
QEST
2006
IEEE
16 years 4 days ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
GD
2006
Springer
15 years 9 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
GD
1995
Springer
15 years 9 months ago
Incremental Layout in DynaDAG
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
Stephen C. North
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...