Results 11 to 20 of about 208,933 (266)
Chained structure of directed graphs with applications to social and transportation networks
The need to determine the structure of a graph arises in many applications. This paper studies directed graphs and defines the notions of $$\ell$$ ℓ -chained and $$\{\ell ,k\}$$ { ℓ , k } -chained directed graphs.
Anna Concas +4 more
doaj +1 more source
In response to the problem that current multi-city multi-pollutant prediction methods based on one-dimensional undirected graph neural network models cannot accurately reflect the two-dimensional spatial correlations and directedness, this study proposes
Li Wang +10 more
doaj +1 more source
Effective Computation of a Feedback Arc Set Using PageRank
Computing a minimum Feedback Arc Set (FAS) is important for visualizing directed graphs in hierarchical style. It is the first step of both known frameworks for hierarchical graph drawing of directed graphs and it is NP-hard.
Vasileios Geladaris +2 more
doaj +1 more source
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj +1 more source
Mann Iterative Algorithm in Convex Metric Spaces Endowed with a Directed Graph
Compared to the general metric space, the metric space endowed with a directed graph is more complex in space structure, and the directed graph itself does not have a linear structure, and it is relatively difficult to explore the problems of the fixed ...
YANGNi, CHENLili
doaj +1 more source
Hamiltonicity in Directed Toeplitz Graphs with s1=1 and s3=4
A directed Toeplitz graph Tns1,⋯,sk;t1,⋯,tl with vertices 1, 2, ⋯, n is a directed graph whose adjacency matrix is a Toeplitz matrix. In this paper, we investigate the Hamiltonicity in directed Toeplitz graphs Tns1,⋯,sk;t1,⋯,tl with s1=1 and s3=4.
Shabnam Malik
doaj +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
The lack of anisotropic kernels in graph neural networks (GNNs) strongly limits their expressiveness, contributing to well-known issues such as over-smoothing. To overcome this limitation, we propose the first globally consistent anisotropic kernels for GNNs, allowing for graph convolutions that are defined according to topologicaly-derived directional
Beaini D. +5 more
openaire +4 more sources
On total directed graphs of non-commutative rings
For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
Directed Representative Graph Modeling of MEP Systems Using BIM Data
Mechanical, electrical, and plumbing (MEP) systems are crucial to a building, which directly affect the building safety, energy saving, and operational efficiency.
Junjun Han +5 more
doaj +1 more source

