We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
System design often explores optimality of performance. What is optimal is, however, often not predefined or static in most cases, because it is affected by the context of operat...
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
Emergence of social web services like YouTube[1], Flickr[2] etc. is constantly transforming the way we share our lifestyles with family, friends and colleagues. The significance of...
Simo Hosio, Fahim Kawsar, Jukka Riekki, Tatsuo Nak...