Results 71 to 80 of about 8,370 (109)

Advancing first-contact, primary care physiotherapist practice: the value of integrating point-of-care diagnostic tools. [PDF]

Front Rehabil Sci
Savage NJ, Nielsen RP, Nitz A, Rawat M, Steiner BUK.   +4 more
europepmc   +1 more source

Minimal vs Specialized Exercise Equipment for Pulmonary Rehabilitation: A Randomized Clinical Trial.

JAMA Netw Open
Nolan CM, Glen C, Walsh JA, Patel S, Barker RE, Polgar O, Spain N, Littlemore H, Jung P, Edwards GD, Jenkins TO, Harvey J, Ingram K, Newby C, Steiner M, Wilson R, Gao W, Fiorentino F, Chukwusa E, May P, Maddocks M, Man WDC.   +21 more
europepmc   +1 more source

Community Health Worker Support for Hispanic and Latino Individuals Receiving Hemodialysis: The Navigate-Kidney Randomized Clinical Trial.

JAMA Intern Med
Cervantes L, Juarez-Colunga E, Powe NR, Flythe JE, Steiner JF, Cukor D, Hasnain-Wynia R, Furgeson S, Golestaneh L, Camacho C, McBeth L, Beaty BL, Shi J, Bacon E, Chonchol M.   +14 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Steiner Distance-Hereditary Graphs

SIAM Journal on Discrete Mathematics, 1994
For a given connected graph \(G\) and a set \(S \subseteq V(G)\) the authors define the Steiner distance of \(S\) in \(G\), denoted by \(d_ G(S)\), as the smallest number of edges in a connected subgraph of \(G\) that contains \(S\). A connected graph \(G\) is \(k\)-Steiner distance-hereditary, \(k \geq 2\), if for every \(S \subseteq V(G)\) such that \
Ortrud Oellermann
exaly   +3 more sources

Isometric subgraphs for Steiner distance

Journal of Graph Theory, 2020
AbstractLet G be a connected graph and a length‐function on the edges of G. The Steiner distance sdG(A) of A ⊆ V(G) within G is the minimum length of a connected subgraph of G containing A, where the length of a subgraph is the sum of the lengths of its edges.
Daniel Weißauer
exaly   +3 more sources

On Steiner degree distance of trees

Applied Mathematics and Computation, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman
exaly   +2 more sources

Semi-Distance Codes and Steiner Systems

Graphs and Combinatorics, 2007
The \textit{semi-distance} between two binary vectors \(x\) and \(y\) of length \(n\) is the number of positions in which \(x\) is one and \(y\) is zero. A binary code \(C\) of length \(n\) is a \textit{\(d\)-semi-distance code} if \(C\) has minimum semi-distance \(d\).
Midori Kobayashi, Kobayashi Midori, Itô Hiro   +2 more
exaly   +2 more sources

Steiner Distance in Join, Corona and Threshold Graphs

2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC), 2017
For a connected graph G and a subset S of its vertices, the Steiner tree problem consists of finding a minimum-size connected subgraph containing S. The Steiner distance of S is the size of a Steiner tree for S, and the Steiner k-diameter of G is the maximum value of the Steiner distance over all vertex subsets S of cardinality k.
Yaping Mao, Eddie Cheng
exaly   +2 more sources

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

SIAM Journal on Computing, 1988
Summary: Distance-hereditary graphs have been introduced by Howorka and studied in the literature with respect to their metric properties. In this paper several equivalent characterizations of these graphs are given: in terms of existence of particular kinds of vertices (isolated, leaves, twins) and in terms of properties of connections, separators ...
Marina Moscarini, Alessandro D'Atri
exaly   +5 more sources

MEAN STEINER DISTANCE OF VICSEK NETWORKS

Fractals, 2021
The four-point Steiner distance is the minimum of the total geodesic distances within the metric space from four given points to a point. For Vicsek networks, we obtain the asymptotic formula of their mean Steiner distances using the method of finite pattern.
LEI LEI, QI JIA, BING ZHAO
openaire   +2 more sources