Results 1 to 10 of about 2,731 (69)
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES
A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same.
Aditya Ambarwati, Vira Hari Krisnawati
doaj +1 more source
A Node Differential Privacy-Based Method to Preserve Directed Graphs in Wireless Mobile Networks
With the widespread popularity of Wireless Mobile Networks (WMNs) in our daily life, the huge risk to disclose personal privacy of massive graph structure data in WMNs receives more and more attention.
Jun Yan, Yihui Zhou, Laifeng Lu
doaj +1 more source
Device Interaction Graph: Directed Decision Graph for Settings Auto-Completion
Knowledge generated from appliances usage data can be used for personalizing and reducing the number of user interactions. Appliances such as Washing Machines (WM) are capable of storing the settings data selected by the user, during operation.
Ramasamy Kannan +2 more
doaj +1 more source
A Model of Directed Graph Cofiber
In the homotopy theory of spaces, the image of a continuous map is contractible to a point in its cofiber. This property does not apply when we discretize spaces and continuous maps to directed graphs and their morphisms.
Zachary McGuirk, Byungdo Park
doaj +1 more source
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

