Sciweavers

2322 search results - page 110 / 465
» On a game in directed graphs
Sort
View
ECCC
2010
143views more  ECCC 2010»
15 years 3 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
WOLLIC
2007
Springer
16 years 13 days ago
Hydra Games and Tree Ordinals
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
Ariya Isihara
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 11 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
CIE
2010
Springer
15 years 11 months ago
Spatial Models for Virtual Networks
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
Jeannette Janssen