Search
Search Results
-
Directed Path Partition Problem on Directed Acyclic Graphs
We study the problem of partitioning the vertex set of a given directed graph $$G = (V,...
-
Other Directed Acyclic Graphs
In this chapter, I want to include a relatively brief example and discussion of directed acyclic graphs (DAG) that are not trees. Back in Chapter 1,...
-
Directed Acyclic Networks and Turn Constraint Paths
We address algorithmic problems in constructing turn constrained paths in a two dimensional Euclidean network. It is known that a shortest path tree...
-
Bridging directed acyclic graphs to linear representations in linear genetic programming: a case study of dynamic scheduling
Linear genetic programming (LGP) is a genetic programming paradigm based on a linear sequence of instructions being executed. An LGP individual can...
-
A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach
At present, the cloud computing environment (CCE) has emerged as one of the significant technologies in communication, computing, and the Internet....
-
Formal Derivation and Verification of Critical Path Algorithm for Directed Acyclic Graph
Graph structure is widely used in network design, path planning, relational processing, electronic circuit design, and power grid tide management....
-
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
We investigate the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs). We focus on the class of DAGs...
-
Implicit Directed Acyclic Graphs (DAGs) for Parallel Outlier/Anomaly Detection Ensembles
We present a methodology to automatically parallelize outlier detection ensemble models using directed acyclic graphs embedding the MapReduce...
-
Embedding Entity and Relation for Knowledge Graph by Probability Directed Graph
Knowledge graph embedding (KGE) represents entities and relationship as low dimensional dense vectors in knowledge graphs (KGs), and to improve the...
-
A secured trusted routing using the structure of a novel directed acyclic graph-blockchain in mobile ad hoc network internet of things environment
In the contemporary technology context, several physical things may be used to support human activities. The Internet of Things is a cutting-edge...
-
IoT-enabled directed acyclic graph in spark cluster
Real-time data streaming fetches live sensory segments of the dataset in the heterogeneous distributed computing environment. This process assembles...
-
On Sensitivity of Compact Directed Acyclic Word Graphs
Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a fundamental data structure on strings with applications in text pattern...
-
Directed Ear Anonymity
We define and study a new structural parameter for directed graphs, which we call ear anonymity. Our parameter aims to generalize the useful...
-
Cache Optimization Based on Linear Regression and Directed Acyclic Task Graph
Based on the principle of locality, the current Cache hit rate has reached a high level. At the same time, its replacement algorithm has also...
-
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
We consider the scenario of routing an agent called a thief through a weighted graph...
-
Acyclic Coloring Parameterized by Directed Clique-Width
An acyclic r-coloring of a directed graph \(G=(V,E)\)...
-
An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph
We propose a novel recommendation algorithm based on acyclic paths in an edge-colored graph. In our method, all the objects including users, items to...
-
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
First, we present a new algorithm for the single-source shortest paths problem (SSSP) in edge-weighted directed graphs, with n vertices, m edges, and...
-
Bundle Allocation with Conflicting Preferences Represented as Weighted Directed Acyclic Graphs
We introduce resource allocation techniques for a problem where (i) the agents express requests for obtaining item bundles as compact edge-weighted...