Results 61 to 70 of about 258,952 (290)

A High‐Scalability Graph Modification System for Large‐Scale Networks [PDF]

open access: yes
Modifying network results is the most intuitive way to inject domain knowledge into network detection algorithms to improve their performance. While advances in computation scalability have made detecting large‐scale networks possible, the human ability ...
Sun, Minghui, Qin, Jun, Xu, Shaobin
core   +1 more source

Phase Angle as an Early Functional Biomarker of Cancer‐Related Fatigue in Pediatric Oncology: A Prospective Longitudinal Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior   +11 more
wiley   +1 more source

Graph Theory for the Middle School. [PDF]

open access: yes, 2006
After being introduced to graph theory and realizing how it can be utilized to solve real-world problems, the author decided to create modules of study on graph theory appropriate for middle school students. In this thesis, four modules were developed in
Robinson, Laura Ann
core   +1 more source

Middle School Students' Line Graph Skills and Affective States about Common Graph Types Used in Science Courses [PDF]

open access: yes, 2020
This study investigated the graphing skills and some affective states of middle school students about graphs by their gender, grade level, and the common graph types used in science courses.
Bursal, Murat, Polat, Fuat
core   +1 more source

Bounds on Co-Independent Liar’s Domination in Graphs

open access: yesJournal of Mathematics, 2021
A set S⊆V of a graph G=V,E is called a co-independent liar’s dominating set of G if (i) for all v∈V, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩S≥3, and (iii) the induced subgraph of G on V−S has no edge.
K. Suriya Prabha   +3 more
doaj   +1 more source

Evaluating the Readability of Patient‐Facing Online Educational Materials for Pediatric Leukemia and Lymphoma

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Together, leukemia and lymphoma account for 38.7% of newly diagnosed pediatric cancer cases in the United States each year. Many caregivers utilize online resources to inform medical health decisions. Understanding the readability of these materials is critical to ensuring comprehensible patient education.
Chloe Strege   +6 more
wiley   +1 more source

Multi-channel spatial-temporal traffic flow prediction based on hybrid static-dynamic graph convolution

open access: yesDianxin kexue, 2023
Aiming at the problem that the traffic flow prediction model did not consider the correlation of road context and the dynamics of spatial dependency, a multi-channel spatial-temporal traffic flow prediction based on hybrid static-dynamic graph ...
Xiongtao ZHANG   +4 more
doaj   +2 more sources

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

Perfect Roman domination in middle graphs [PDF]

open access: yesDiscrete Mathematics Letters, 2021
Kijung Kim
doaj   +1 more source

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

open access: yesDiscrete Mathematics, 1979
AbstractWe construct decompositions of L(Kn), M(Kn) and T(Kn) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs.
Akiyama, Jin, Hamada, Takashi
openaire   +3 more sources

Home - About - Disclaimer - Privacy