Results 81 to 90 of about 70,417 (125)

An improved greedy equivalent search method based on relative entropy. [PDF]

Sci Rep
Liu X, Feng Q, Yang Z, Wu S, Gao X, Yang Y, He C, Ren J.   +7 more
europepmc   +1 more source

Methods in causal inference. Part 1: causal diagrams and confounding. [PDF]

Evol Hum Sci
Bulbulia JA.
europepmc   +1 more source

Competitive oscillatory dynamics in excitable neuron networks. [PDF]

Front Netw Physiol
Zheng Z, Yan L, Li T, Liu J, Wang L, Qian Y.   +5 more
europepmc   +1 more source

Counting Temporal Paths. [PDF]

Algorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

iGraphCTC: an inter-connected graph convolutional network for comprehensive clinical trial collaborations. [PDF]

Sci Rep
Jang J, Ahn H, Park E.
europepmc   +1 more source

Identifiability of Phylogenetic Level-2 Networks under the Jukes-Cantor Model

Englander AK, Frohn M, Gross E, Holtgrefe N, Van Iersel L, Jones M, Sullivant S.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

Journal of Algorithms, 1996
Summary: This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown.
Babel, L., Ponomarenko, I. N., Tinhofer, G.   +2 more
openaire   +2 more sources

Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem

International Colloquium on Automata, Languages and Programming, 2020
In the Single Source Replacement Paths (SSRP) problem we are given a graph $G = (V, E)$, and a shortest paths tree $\widehat{K}$ rooted at a node $s$, and the goal is to output for every node $t \in V$ and for every edge $e$ in $\widehat{K}$ the length ...
S. Chechik, Ofer Magen
semanticscholar   +1 more source

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs

Networks
Chordal graphs are the intersection graphs of subtrees of a tree, while interval graphs of subpaths of a path. Undirected path graphs, directed path graphs and rooted directed path graphs are intermediate graph classes, defined, respectively, as the ...
C. Figueiredo, Raul Lopes, A. Melo, Ana Silva   +3 more
semanticscholar   +1 more source