552 search results - page 63 / 111 » Lower bounds for dynamic connectivity |
CAS
2008
14 years 12 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
102
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
SIAMCO
2010
14 years 6 months ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
SIAMDM
2010
14 years 6 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...