Results 31 to 40 of about 92,871 (231)
Cycle analysis of Directed Acyclic Graphs
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected graph and augment its components with direction information. We show that only four classes of directed cycles exist,
Vasiliauskaite, Vaiva +2 more
openaire +5 more sources
Nero: A Deterministic Leaderless Consensus Algorithm for DAG-Based Cryptocurrencies
This paper presents the research undertaken with the goal of designing a consensus algorithm for cryptocurrencies with less latency than the current state-of-the-art while maintaining a level of throughput and scalability sufficient for real-world ...
Rui Morais +2 more
doaj +1 more source
Reconstruction of a directed acyclic graph with intervention. [PDF]
Identification of causal relations among variables is central to many scientific investigations, as in regulatory network analysis of gene interactions and brain network analysis of effective connectivity of causal relations between regions of interest.
Peng S, Shen X, Pan W.
europepmc +5 more sources
Lesson 3: How to Construct Research Hypotheses, and Directed Acyclic Graphs
Etsuji Suzuki
exaly +3 more sources
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
Replacement Paths via Row Minima of Concise Matrices [PDF]
Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields
Lee, Cheng-Wei, Lu, Hsueh-I
core +1 more source
Covering Pairs in Directed Acyclic Graphs [PDF]
ISSN:1460 ...
Beerenwinkel, N +4 more
openaire +5 more sources
A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling
The multiprocessor task scheduling problem has received considerable attention over the last three decades. In this context, a wide range of studies focuses on the design of evolutionary algorithms.
Eduardo C. da Silva, Paulo H. R. Gabriel
doaj +1 more source
Learning linear non-Gaussian graphical models with multidirected edges
In this article, we propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model with given observational data.
Liu Yiheng, Robeva Elina, Wang Huanqing
doaj +1 more source
The Reduction of Directed Cyclic Graph for Task Assignment Problem
In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists.
Ariffin W.N.M.
doaj +1 more source

