Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
The paper describes a method for predicting climate time series that consist of significant annual and diurnal seasonal components and a short-term stockastic component. A memory...
Solution-driven product line engineering is a project business where products are created for each customer individually. Although reuse of results from former projects is widely ...
Christoph Elsner, Daniel Lohmann, Wolfgang Schr&ou...
In this paper, we describe our modifications to ospfd, a popular open-source implementation of OSPF routing protocol. The ospfd software can also be run in simulation mode, where...