: In this paper we describe a solution for the semi-automatic ontology based text annotation (OnTeA) tool. The tool analyzes a document or text using regular expression patterns an...
Michal Laclavik, Martin Seleng, Emil Gatial, Zolta...
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
William Y. C. Chen, Louis W. Shapiro, Laura L. M. ...
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
We present a seemingly new definition of flows and flow numbers for oriented matroids and prove that the flow number L and the antisymmetric flow number Las of an oriented matroid...