Related papers: Strong geodetic problem in networks: computational…
In this article we introduce the p-adic cellular neural networks which are mathematical generalizations of the classical cellular neural networks (CNNs) introduced by Chua and Yang. The new networks have infinitely many cells which are…
We introduce hyperbolic attention networks to endow neural networks with enough capacity to match the complexity of data with hierarchical and power-law structure. A few recent approaches have successfully demonstrated the benefits of…
Systematic relations between multiple objects that occur in various fields can be represented as networks. Real-world networks typically exhibit complex topologies whose structural properties are key factors in characterizing and further…
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined.…
Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes or (virtualized) network…
The problem of connectivity assessment in an asymmetric network represented by a weighted directed graph is investigated in this article. A power iteration algorithm in a centralized implementation is developed first to compute the…
We propose a hybrid heuristic algorithm for solving the Heaviest k-Subgraph Problem in online social networks -- a combinatorial graph optimization problem central to many important applications in weighted social networks, including…
In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove…
Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…
We present the first exact polynomial time algorithm for constructing optimal geometric bottleneck 2-connected Steiner networks containing at most $k$ Steiner points, where $k>2$ is a constant. Given a set of $n$ vertices embedded in an…
Combinatorial optimizations are usually complex and inefficient, which limits their applications in large-scale networks with billions of links. We introduce a distributed computational method for solving a node-covering problem at the…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
In energy system analysis, coupling models with mismatched spatial resolutions is a significant challenge. A common solution is assigning weights to high-resolution geographic units for aggregation, but traditional models are limited by…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and…
The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.
The geometric renormalization technique for complex networks has successfully revealed the multiscale self-similarity of real network topologies and can be applied to generate replicas at different length scales. In this letter, we extend…
We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their…
Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media…