. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...