Results 71 to 80 of about 92,871 (231)
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +1 more source
Ramsey theory and thermodynamics
Re-shaping of thermodynamics with the graph theory and Ramsey theory is suggested. Maps built of thermodynamic states are addressed. Thermodynamic states may be attainable and non-attainable by the thermodynamic process in the system of constant mass. We
Nir Shvalb +3 more
doaj +1 more source
Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT
In directed graphs, we investigate the problems of finding: 1) a minimum feedback vertex set (also called the Feedback Vertex Set problem, or MFVS), 2) a feedback vertex set inducing an acyclic graph (also called the Vertex 2-Coloring without ...
Rusu, Irena
core +2 more sources
Asymptotic evolution of acyclic random mappings [PDF]
An acyclic mapping from an $n$ element set into itself is a mapping $\phi$ such that if $\phi^k(x) = x$ for some $k$ and $x$, then $\phi(x) = x$. Equivalently, $\phi^\ell = \phi^{\ell+1} = ...$ for $\ell$ sufficiently large.
Evans, Steven N., Lidman, Tye
core +2 more sources
Random Generation of Directed Acyclic Graphs
Abstract Abstract We propose a simple algorithm based on a Markov chain for generating acyclic digraphs with a given number of vertices uniformly at random. In addition, standard combinatorial techniques allow us to describe the overall shape and average edge density of an acyclic digraph.
Melançon, Guy +2 more
openaire +2 more sources
Multi-scale features for heartbeat classification using directed acyclic graph CNN
A new architecture of deep neural networks, directed acyclic graph convolutional neural networks (DAG-CNNs), is used to classify heartbeats from electrocardiogram (ECG) signals into different subject-based classes.
Zahra Golrizkhatami +2 more
doaj +1 more source
Metabolomics analysis: Finding out metabolic building blocks. [PDF]
In this paper we propose a new methodology for the analysis of metabolic networks. We use the notion of strongly connected components of a graph, called in this context metabolic building blocks.
Ricardo Alberich +3 more
doaj +1 more source
Chordal Graphs are Fully Orientable [PDF]
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of the number of dependent arcs over all acyclic orientations of G.
Lai, Hsin-Hao, Lih, Ko-Wei
core
Broadcasting on Random Directed Acyclic Graphs
33 pages, double column format.
Anuran Makur +2 more
openaire +3 more sources
DAG Based Multipath Routing Algorithm for Load Balancing in Machine-to-Machine Networks
In M2M networks, most nodes are powered by battery; hence the overused nodes may easily be out of power, which causes the reduction of network lifetime.
Liang Liu, Tao Zhang, Jun Zhang
doaj +1 more source

