730 search results - page 10 / 146 » Combinatorics of Monotone Computations |
COMBINATORICS
2006
13 years 7 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
DMTCS
2003
13 years 8 months ago
2003
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
CCCG
2010
13 years 9 months ago
2010
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer