We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Collecting and exploring monitoring data is becoming increasingly challenging as networks become larger and faster. Solutions based on both SQL-databases and specialized binary for...
Quantitative data about security threats is a precondition for a precise assessment of security risks and consequently for an efficient management of information security. Curren...
An image browser for the exploration of image collections is described. The approach taken is to utilize VR input devices to develop more intuitive interaction metaphors that allo...