5 search results - page 1 / 1 » Digraph Decompositions and Monotonicity in Digraph Searching |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
GC
2006
Springer
13 years 4 months ago
2006
Springer
FSTTCS
2007
Springer
13 years 11 months 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...
ECCC
2010
13 years 2 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...