Paintings by Magritte and others were borrowed for “The Phoenician Scheme.” Safeguarding them amid the hot lights and chaos of a film set was challenging. By Esther Zuckerman At the end of Wes ...

Specifically, we introduce a new transitively closed undirected graph authentication (TCUGA) scheme, which only needs to use node signatures (e.g., certificates for identifying nodes). The trapdoor ...

In the construction of QSAR models for the prediction of molecular activity, feature selection is a common task aimed at improving the results and understanding of the problem. The selection of ...

The objective is to compute a tree-decomposition of minimum width. Input: An undirected graph. Output: A minimum-width tree-decomposition of the graph. The theory and complexity of treewidth has been ...

Blockchain can potentially be deployed in a wide range of applications due to its capability to ensure decentralization, transparency, and immutability. In this paper, we design a cryptographic ...

For illustrative purposes, in Fig. 1 we present a scheme of the visibility algorithm. In the upper zone we plot the first 20 values of a periodic series by using vertical bars (the data values are ...

A graph G (V,E) is a finite, nonempty set of vertices, V, or nodes and a set of edges, E. If the edges E that have the form of (a,b) are ordered pairs of vertices, then we have a directed graph. If ...