Results 11 to 20 of about 3,292 (264)
Transitive reduction of citation networks [PDF]
Journal of Complex Networks, 2014 17 pages, 13 figures, data ...
James R. Clough +3 more
core +11 more sources
fastBMA: scalable network inference and transitive reduction. [PDF]
Gigascience, 2017 Abstract BACKGROUND: Inferring genetic networks from genome-wide expression data is extremely demanding computationally. We have developed fastBMA, a distributed, parallel and scalable implementation of Bayesian model averaging (BMA) for this purpose. fastBMA also includes a novel and computationally
Hung LH +5 more
europepmc +7 more sources
TRANSWESD: inferring cellular networks with transitive reduction. [PDF]
Bioinformatics, 2010 Abstract Motivation: Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networks because it facilitates detection and removal of false positive edges. Transitive reduction is one approach for eliminating edges reflecting indirect effects but its use in reconstructing cyclic interaction ...
Klamt S, Flassig RJ, Sundmacher K.
europepmc +8 more sources
Transitive reduction of a nilpotent boolean matrix [PDF]
Discrete Applied Mathematics, 1984 Given an acyclic digraph, a problem which frequently arises in applications consists in removing the maximum number of arcs without affecting reachability. This removal corresponds to a so-called transitive reduction of the adjacency matrix of the given digraph.
Hashimoto, Hiroshi
openaire +3 more sources
Fully Dynamic Algorithms for Transitive Reduction [PDF]
CoRRAccepted at ICALP ...
Gramoz Goranci +3 more
openaire +5 more sources
Parameterized Linear Time Transitive Closure [PDF]
Journal of Graph Algorithms and ApplicationsIn this paper, we first study the problem of decomposing a directed acyclic graph (DAG), $G=(V, E)$ into vertex-disjoint chains and present a fast and practical chain decomposition technique.
Giorgos Kritikakis, Ioannis Tollis
doaj +3 more sources
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Bessouf, Ouahiba +2 more
openaire +2 more sources
On the Transition Reduction Problem for Finite Automata [PDF]
Fundamenta Informaticae, 2014 In this paper we apply the concept of common follow sets (CFS) of a regular expression to homogeneous finite state automaton. Based on this concept and using particular binary trees, we devise an efficient algorithm to reduce (minimize) the number of transitions of the automaton recognizing the language L(En) denoted by the regular expression $E_n = (1
el Houcein el Abdalaoui +2 more
openaire +3 more sources
Block-transitive, point-primitive Steiner 3-designs [PDF]
, 2021 This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial Steiner 3-design ...
Gan, Yunsong, Liu, Weijun
core +2 more sources
Emergence and reduction combined in phase transitions [PDF]
AIP Conference Proceedings, 2012 24 pp, v2: one minor change.
Butterfield, Jeremy, Bouatta, Nazim
openaire +2 more sources