2322 search results - page 23 / 465 » On a game in directed graphs |
ICML
2007
IEEE
16 years 19 days ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
103
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
110
click to vote
ALGORITHMICA
2000
14 years 11 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
ITICSE
2005
ACM
15 years 5 months ago
2005
ACM
SIMUTOOLS
2008
15 years 1 months ago
2008
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...