Sciweavers

210 search results - page 6 / 42
» Uniform regular enumerations
Sort
View
CPC
1998
154views more  CPC 1998»
13 years 7 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 11 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna
MLQ
2002
81views more  MLQ 2002»
13 years 7 months ago
Apartness, Topology, and Uniformity: a Constructive View
The theory of apartness spaces, and their relation to topological spaces (in the point--set case) and uniform spaces (in the set--set case), is sketched. New notions of local decom...
Douglas S. Bridges, Peter Schuster, Luminita V&ici...
DCG
2010
64views more  DCG 2010»
13 years 7 months ago
Uniform Convergence of Discrete Curvatures from Nets of Curvature Lines
We study discrete curvatures computed from nets of curvature lines on a given smooth surface and prove their uniform convergence to smooth principal curvatures. We provide explicit...
Ulrich Bauer, Konrad Polthier, Max Wardetzky
ENTCS
2002
110views more  ENTCS 2002»
13 years 7 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat