We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Saving internal program data for further use is one of the most useful ideas in programming. Developing general features to provide such data saving/ restoring is a very active res...