Results 51 to 60 of about 2,455,447 (352)
Malignant astrocytic glioma: genetics, biology, and paths to treatment.
Malignant astrocytic gliomas such as glioblastoma are the most common and lethal intracranial tumors. These cancers exhibit a relentless malignant progression characterized by widespread invasion throughout the brain, resistance to traditional and newer ...
F. Furnari +12 more
semanticscholar +1 more source
Showing the path to path dependence: the habitual path [PDF]
This article investigates the conceptual and theoretical implications of the logic of habit for the path-dependence approach. In the existing literature, we see two different logics of action associated with two distinct models of path dependence: the logic of consequences (instrumental rationality) is linked with utilitarian paths (i.e.
openaire +3 more sources
Note on the problem of partially link disjoint paths [PDF]
This paper discusses the problem of partially link disjoint paths in communication networks. The problem is situated in between the well-known shortest path generation and the synthesis of two disjoint paths.
R.J. Harris +3 more
core +1 more source
We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
A Path-Based Partial Information Decomposition
Based on the conceptual basis of information theory, we propose a novel mutual information measure—‘path-based mutual information’. This information measure results from the representation of a set of random variables as a probabilistic graphical model ...
David Sigtermans
doaj +1 more source
Band structure diagram paths based on crystallography [PDF]
Systematic and automatic calculations of the electronic band structure are a crucial component of computationally-driven high-throughput materials screening.
Y. Hinuma +4 more
semanticscholar +1 more source
Verifying a conjecture of Petkov{š}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.
openaire +4 more sources
Inducibility of directed paths [PDF]
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices.
Choi, Ilkyoo +2 more
core
The Saturation Number for the Length of Degree Monotone Paths
A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G).
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn
The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs,
Michal Staš +2 more
doaj +1 more source

