2322 search results - page 106 / 465 » On a game in directed graphs |
170
click to vote
MICAI
2005
Springer
15 years 11 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
177
click to vote
VIS
2007
IEEE
16 years 7 months ago
2007
IEEE
The effectiveness of direct volume rendering is difficult to validate and users may not know whether they have successfully explored the data or not. This limits its applications....
170
click to vote
FSTTCS
2007
Springer
16 years 14 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
287
click to vote
DISOPT
2011
15 years 1 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
202
click to vote
TIT
2010
15 years 1 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...