Results 81 to 90 of about 433,943 (319)
Molecular Oncology, EarlyView.This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain +3 more
wiley +1 more source
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
Discussiones Mathematicae Graph Theory, 2013 We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40+1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Borodin Oleg V., Ivanova Anna O.
doaj +1 more source
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study aims to evaluate how different gantry angles, breathing rates (BPM), cine image speeds, and tracking algorithms affect beam on/off latency and the subsequent impact on target dose for a 0.35T MR‐Linac with a 6 MV FFF beam.
Mateb Al Khalifa +4 more
wiley +1 more source
Mixed Linear Layouts of Planar Graphs
, 2017 A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface
Кібернетика та комп'ютерні технології, 2022 Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk +2 more
doaj +1 more source
Long‐term stability analysis of beam shape in a robotic radiosurgery system
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study aimed to investigate the long‐term stability of CyberKnife beam profile parameters and assess their compliance with existing quality assurance (QA) guidelines. We evaluated beam profiles in both standard and diagonal planes over 3.5 years post‐installation to detect potential issues and ensure consistent beam quality.
Ryoichi Hinoto +4 more
wiley +1 more source
Radiotherapy medical physics in the Philippines: A contemporary overview
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose With cancer ranking as the third leading cause of death in the Philippines and a disparity in healthcare resources across regions, this research aimed to assess the state of radiotherapy medical physics in the country. Methodology The study utilized a comprehensive online survey with 94 structured questions answered by 19 clinics ...
John Paul C. Cabahug +4 more
wiley +1 more source
Obstacle Numbers of Planar Graphs
, 2017 Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph with vertex set $
B Mohar +9 more
core +1 more source
T-shape visibility representations of 1-planar graphs [PDF]
Computational Geometry, 2018 26 pages, 8 ...
openaire +4 more sources