1215 search results - page 173 / 243 » Combinatorics |
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...