Results 101 to 110 of about 3,337,855 (342)
Temporal Graph Traversals: Definitions, Algorithms, and Applications [PDF]
, 2014 A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph.
Cheng, James, Huang, Silu, Wu, Huanhuan
core
International Journal of Foundations of Computer Science, 2008 Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the same vertex and of which precisely one edge is enabled at any time. By using a Boolean function called a switch setting, the switches in a switching graph can be put in a fixed direction to obtain an ordinary graph.
Jan Friso Groote, Bas Ploeger
openaire +4 more sources
Molecular Oncology, EarlyView.We assessed the associations between the gut microbiota and outcome in metastatic triple‐negative breast cancer patients treated with chemotherapy alone or chemotherapy in combination with immunotherapy. Our data indicate that high gut microbiota alpha diversity was associated with improved clinical outcome and with benefit from immunotherapy.
Andreas Ullern +8 more
wiley +1 more source
Factors associated with the risk of HIV infection among HIV-exposed infants in Malawi: 2013–2020
BMJ Paediatrics Open, 2022 Janne Estill +6 more
doaj +1 more source
Reproducibility of graph metrics of human brain structural networks
Frontiers in Neuroinformatics, 2014 Recent interest in human brain connectivity has led to the application of graph theoretical analysis to human brain structural networks, in particular white matter connectivity inferred from diffusion imaging and fiber tractography.
Jeffrey Thomas Duda +2 more
doaj +1 more source
Graph limits and hereditary properties [PDF]
arXiv, 2011 We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs, chordal graphs, cographs, interval graphs, unit interval graphs, threshold graphs, and line graphs.
arxiv
, 2010 We present a unified framework to study graph kernels, special cases of which include the random walk (Gärtner et al., 2003; Borgwardt et al., 2005) and marginalized (Kashima et al., 2003, 2004; Mahé et al., 2004) graph kernels.
Borgwardt, Karsten M. +3 more
core
, 2000 Using rationality, like in language theory, we define a family of infinite graphs. This family is a strict extension of the context-free graphs of Muller and Schupp, the equational graphs of Courcelle and the prefix recogniza- ble graphs of Caucal. We give basic properties, as well as an internal and an external characterization of these graphs.
openaire +6 more sources
Molecular Oncology, EarlyView.PIK3CA amplification and PIK3CA mutation enhance ovarian tumorigenicity through an activation of AKT, which phosphorylates YAP at Ser127. This Ser127 phosphorylation leads to the retention of YAP in the cytoplasm and triggers RAC1 activity, promoting cell migration. Additionally, AKT activation increases expression of N‐cadherin, which further enhances
Shibo Zhang +6 more
wiley +1 more source
On the Beta-Number of Forests with Isomorphic Components
Discussiones Mathematicae Graph Theory, 2018 The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio +3 more
doaj +1 more source