Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
Teaching pupils the ideas behind objects in programming languages can be difficult since these concepts are mostly and not comprehensible at first sight. Etoys as a visual progra...
Michael Haupt, Michael Perscheid, Robert Hirschfel...