Results 201 to 210 of about 3,533,009 (320)
Objective This study examined the global and regional temporal changes in cross‐country inequalities of site‐specific osteoarthritis (OA) burden from 1990 to 2021. Methods Age‐standardized years lived with disability rate for site‐specific OA across 204 countries/territories were obtained from the Global Burden of Diseases Study (GBD) 2021.
Haowei Chen+14 more
wiley +1 more source
Application of fuzzy credibility graph in climate mitigation strategy assessment. [PDF]
Ullah I+3 more
europepmc +1 more source
Objective This study aimed to determine if program format (in‐person, virtual, hybrid) results in differences in three‐month outcomes of pain, function, quality of life, self‐efficacy and chair stands in a hip/knee osteoarthritis management program. Methods A secondary analysis of the GLA:DTM Canada database was completed.
Jill Van Damme+7 more
wiley +1 more source
COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
Gillian Ford, G. E. Uhlenbeck
openalex +1 more source
Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) [PDF]
Milton Abramowitz+2 more
openalex +1 more source
Improving drug-induced liver injury prediction using graph neural networks with augmented graph features from molecular optimisation. [PDF]
Lee T, Posma JM.
europepmc +1 more source
Objectives This study aims to develop hip morphology‐based radiographic hip osteoarthritis (RHOA) risk prediction models and investigates the added predictive value of hip morphology measurements and the generalizability to different populations. Methods We combined data from nine prospective cohort studies participating in the World COACH consortium ...
Myrthe A. van den Berg+26 more
wiley +1 more source
On path graphs of incidence graphs
For a given graph G and a positive integer k the P_k-path graph P_k(G) has for vertices the set of paths of length k in G. Two vertices are connected in P_k(G) when the intersection of the corresponding paths forms a path of length k-1 in G, and their union forms either a cycle or a path of length k+1.
openaire +3 more sources
An upper bound for the chromatic number of a graph and its application to timetabling problems [PDF]
Dominic Welsh
openalex +1 more source