Related papers: The Core of Directed Network Problems with Quotas
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is…
We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly…
The purpose of this short paper is to provide a theoretical analysis for the consensus problem under nonlinear protocols. A main contribution of this work is to generalize the previous consensus problems under nonlinear protocols for…
The development of multi-core processor systems is a demanded branch of science and technology. The appearance of processors with dozens and hundreds of cores poses to the developers the question of choosing the optimal topology capable to…
Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on vertex property function…
In this Letter we propose a method to control a set of arbitrary nodes in a directed network such that they follow a synchronous trajectory which is, in general, not shared by the other units of the network. The problem is inspired to those…
A directed phylogenetic network is tree-child if every non-leaf vertex has a child that is not a reticulation. As a class of directed phylogenetic networks, tree-child networks are very useful from a computational perspective. For example,…
This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of a celebrated…
We propose a new directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing graphical models: generalized additive models and CP-networks. The network decomposes a utility function…
A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The solution to these issues is becoming more challenging due to…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
The aim of a quantum network is to enable the generation of end-to-end entangled links between end nodes of the network, so that they can execute quantum network applications. To facilitate this, it is desirable to have robust control of…
We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and convexity when the finite field is…
Any directed graph $D=(V(D),A(D))$ in this work is assumed to be finite and without self-loops. A source in a directed graph is a vertex having at least one ingoing arc. A quasi-kernel $Q\subseteq V(D)$ is an independent set in $D$ such…
We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with…
In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding…
We introduce the notion of quota trees in directed graphs. Given a nonnegative integer ``quota'' for each vertex of a directed multigraph $G$, a quota tree is an immersed rooted tree which hits each vertex of $G$ the prescribed number of…
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give…
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding…
The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important sub-networks in two-mode networks. The…