374 search results - page 14 / 75 » Stochastic Minority on Graphs |
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
GD
2003
Springer
14 years 18 days ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...