In this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. The model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. By using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. T...

In this paper, we address a new problem in the field of argumentation theory: the link between two different change operations, namely addition and removal of an argument. We define two concepts of duality reflecting this link. They are used to propose new results about an operation from existing results concerning its dual operation. Finally, the propositions that are obtained are studied for ...

This document describes the historical and background information behind the removal of the "on-link assumption" from the conceptual host sending algorithm defined in Neighbor Discovery for IP Version 6 (IPv6). According to the algorithm as originally described, when a host’s default router list is empty, the host assumes that all destinations are on-link. This is particularly problematic with ...

A large body of network-related problems can be formulated or explained by Moore-Penrose inverse of the graph Laplacian matrix of the network. This paper studies the impact of overlaying or removing a subgraph (inserting / removing a group of links, or modifying a set of link weights) on MoorePenrose inverse of the Laplacian matrix of an existing network topology. Moreover, an iterative method ...

Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobociński. In this paper we show that most of the HLR properties, which had been introduced to generalize some basic resu...