A note on the asymptotic behavior of the heights in -trees for large.
A note on the computational complexity of computing the edge rotation distance between graphs
A note on the computational complexity of hierarchical overlapping clustering
In this paper the computational complexity of the problem of the approximation of a given dissimilarity measure on a finite set by a -ultrametric on and by a Robinson dissimilarity measure on is investigared. It is shown that the underlying decision problems are NP-complete.
A note on the Glauber dynamics for sampling independent sets.
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(logn) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters96 (2005) 81–88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based on this approach we deduce that the problem does not admit constant approximation algorithms for connected...
A note on the iteration of infinite matrices
A note on the minimality problem in indefinite summation of rational functions.
A note on the minimalization of tree-automata
A note on the number of squares in a partial word with one hole
A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of length n is bounded by 2n since at each position there are at most two distinct squares whose last occurrence starts. In this paper, we investigate squares in partial words with one hole, or sequences over a finite alphabet that have a “do not know” symbol or “hole”. A square in a partial word over a given alphabet has the form uv where u is compatible with v, and consequently, such square is...
A note on the paper “disjunctive languages and compatible orders”
A note on the recognition of one counter languages
A note on the richness of convex hulls of VC classes.
A note on the undecidability of contextfreeness
A note on tree realizations of matrices
It is well known that each tree metric M has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of M. We extend this result to the class of symmetric matrices M with zero diagonal, positive entries, and such that mij + mkl ≤ max{mik + mjl, mil + mjk} for all distinct i,j,k,l.
A note on univoque self-sturmian numbers
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interval into itself, but it also characterizes univoque real numbers; the other is a disguised version of the set of characteristic sturmian sequences. As a corollary to our study we obtain that a real number in is univoque and self-sturmian if and only if the -expansion of is of the form , where is a characteristic...
A note on univoque self-Sturmian numbers
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interval into itself, but it also characterizes univoque real numbers; the other is a disguised version of the set of characteristic Sturmian sequences. As a corollary to our study we obtain that a real number β in (1,2) is univoque and self-Sturmian if and only if the β-expansion of 1 is of the form 1v, where v is a characteristic...
A note on van Wijngaarden syntax
A note on -rules in context-free grammars
A novel approach for detection and elimination of automorphic graphs in graph databases.
A novel continuous model to approximate time Petri nets: modelling and analysis
In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net models, such as the CCPN (constant speed CPN), VCPN (variable speed CPN) and the ACPN (asymptotic CPN), have...