1857 search results - page 40 / 372 » Minimum Degree Orderings |
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
CCA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
EJC
2008
13 years 10 months ago
2008
The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minim...
SYNTHESE
2010
13 years 9 months ago
2010
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
13 years 5 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...