Zobrazeno 1 - 10
of 1 419
pro vyhledávání: '"weighted graph"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 16-22 (2024)
AbstractThe aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of t
Externí odkaz:
https://doaj.org/article/b8eb43a6026e48fd80c0f856dce8072c
Publikováno v:
Machine Learning and Knowledge Extraction, Vol 5, Iss 4, Pp 1905-1920 (2023)
This paper is part of a line of research devoted to developing a compositional and geometric theory of Group Equivariant Non-Expansive Operators (GENEOs) for Geometric Deep Learning. It has two objectives. The first objective is to generalize the not
Externí odkaz:
https://doaj.org/article/55c31ce5fab94e558e2bf0a94cfcfa68
Autor:
Xiaofeng Zhao, Mingao Yuan
Publikováno v:
Mathematics, Vol 12, Iss 17, p 2745 (2024)
In network data analysis, one of the important problems is determining if two collections of networks are drawn from the same distribution. This problem can be modeled in the framework of two-sample hypothesis testing. Several graph-based two-sample
Externí odkaz:
https://doaj.org/article/53dfe092d465453aafd4e525d3e123d0
Publikováno v:
Mathematics, Vol 12, Iss 15, p 2359 (2024)
In this paper, three sorts of network indices for the weighted three-layered graph are studied through the methods of graph spectra theory combined with analysis methods. The concept of union of graphs are applied to design two sorts of weighted laye
Externí odkaz:
https://doaj.org/article/9cefb6e4589c407baf5ddc6e0f7ac4e6
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2206 (2024)
Finding the densest subgraph has tremendous potential in computer vision and social network research, among other domains. In computer vision, it can demonstrate essential structures, and in social network research, it aids in identifying closely ass
Externí odkaz:
https://doaj.org/article/5a7d1b7fbfc7410783abd4fb5d33ab4b
Publikováno v:
Jurnal Lebesgue, Vol 4, Iss 2, Pp 940-948 (2023)
The determination of the shortest route can be done using various methods, one of which is the Dijkstra algorithm. This algorithm is often used in routing problems with minimum weight in computer networks, communication networks and transportation ne
Externí odkaz:
https://doaj.org/article/f61f711f71314606b9b1cdd399a44437
Publikováno v:
Water Supply, Vol 23, Iss 8, Pp 3432-3452 (2023)
Recently, the scale and complexity of water distribution networks (WDNs) have been increasing with the acceleration of urbanization process. It has become a hot research focus to use district metering area (DMA) for more efficient management and cont
Externí odkaz:
https://doaj.org/article/302bb1d060af408e97ad7da9a8e62855
Autor:
Shakila Banu, Naveena Selvaraj
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (2023)
A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined. In other words, there may be
Externí odkaz:
https://doaj.org/article/44e00f2bd2764cbfafbf04a1f8681581
Publikováno v:
منظر, Vol 15, Iss 62, Pp 20-27 (2023)
Space syntax theory proposes a quantitative and tangible method to recognize and analyze the space configuration and structure. Although it is not a new technique, it is still applied and evolved. In this regard, the current study sought to solve som
Externí odkaz:
https://doaj.org/article/2c8ea71962ce44c0aba108e5ebe6e244
Publikováno v:
IEEE Access, Vol 11, Pp 58016-58024 (2023)
Detecting rumors on social media has become increasingly necessary due to their rapid spread and adverse impact on society. Currently, most rumor detection methods fail to consider the non-consecutive semantic features of the post’s text or the aut
Externí odkaz:
https://doaj.org/article/4b79e39aca4d4a80b07591f8ab0f31bf