254 search results - page 16 / 51 » Deterministic Soliton Graphs |
89
Voted
CAV
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
88
Voted
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
75
Voted
MFCS
2004
Springer
15 years 2 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
SEMWEB
2005
Springer
15 years 2 months ago
2005
Springer
We propose a declarative update language for RDF graphs which is based on the paradigms of query and view languages RQL and RVL. Our language, called RUL, ensures that the executio...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...