Titlebook: Combinatorial and Algorithmic Aspects of Networking; Third Workshop, CAAN Thomas Erlebach Conference proceedings 2006 Springer-Verlag Berli

Oscillate

支柱

農(nóng)學(xué)

Mhc-Molecule

https://doi.org/10.1007/978-3-319-33201-7routing. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per la

壓艙物

Do Hoon Lee,Wonbin Song,Byung Yang Leea set of messages and a conflict graph that specifies which messages cannot be transmitted concurrently. In our model the conflict graph is a unit circular-arc graph..Two variants of the problem are considered: . and .. In ., the messages have unit demands, whereas in . demands are arbitrary. We pre

套索

vector

OMIT

Smart Sensors at the IoT Frontiereveral forbidden patterns of AS relationships that impose a certain type of acyclicity on the AS graph. We investigate algorithms for solving the . problem, i.e., given a set of AS paths, find an orientation of the edges according to some types of AS relationships such that the oriented AS graph is