Results 231 to 240 of about 59,275 (246)

Coexistence and extinction in flow-kick systems: An invasion growth rate approach. [PDF]

J Math Biol
Schreiber SJ.
europepmc   +1 more source

Motif discovery in hospital ward vital signs observation networks. [PDF]

Netw Model Anal Health Inform Bioinform
Ironside-Smith R, Noë B, Allen SM, Costello S, Turner LD.   +4 more
europepmc   +1 more source

Compression-based inference of network motif sets. [PDF]

PLoS Comput Biol
Bénichou A, Masson JB, Vestergaard CL.
europepmc   +1 more source

Xylosandrus ambrosia beetles preference of nursery tree species for attacks and colonization under water stress. [PDF]

J Insect Sci
Parajuli M, Oksel C, Neupane K, Ranger CM, Baysal-Gurel F.   +4 more
europepmc   +1 more source

Even cycles in enhanced hypercube networks under the conditional fault model. [PDF]

Sci Rep
Liu M.
europepmc   +1 more source

Crossover operators for molecular graphs with an application to virtual drug screening. [PDF]

J Cheminform
Domschke N, Schmidt BJ, Gatter T, Golnik R, Eisenhuth P, Liessmann F, Meiler J, Stadler PF.   +7 more
europepmc   +1 more source

Improving drug-induced liver injury prediction using graph neural networks with augmented graph features from molecular optimisation. [PDF]

J Cheminform
Lee T, Posma JM.
europepmc   +1 more source

Context-dependent spatial multicellular network motifs for single-cell spatial biology

Zamir A, Amitay Y, Tamir Y, Keren L, Zaritsky A.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On induced subgraphs of a block

Journal of Graph Theory, 1977
AbstractIf G is a block, then a vertex u of G is called critical if G ‐ u is not a block. In this article, relationships between the localization of critical vertices and the localization of vertices of relatively small degrees (especially, of degree two) are studied. A block is called semicritical if a) each edge is incident with at least one critical
openaire   +3 more sources

Excluding induced subgraphs: quadrilaterals

Random Structures & Algorithms, 1991
AbstractIn this note we determine the structure of “almost all” graphs not containing a quadrilateral (i.e., a cycle of length four) as an induced subgraph. In particular, it turns out that there are asymptotically twice as many graphs not containing an induced quadrilateral than there are bipartite graphs.
Angelika Steger, Hans Jürgen Prömel
openaire   +2 more sources