The gut contractile organoid for studying the gut motility regulated by coordinating signals between interstitial cells of Cajal and smooth muscles. [PDF]
Yagasaki R +8 more
europepmc +1 more source
Multidisciplinary perinatal management of paroxysmal kinesigenic dyskinesia in pregnancy: a case report and a proposed structured pathway. [PDF]
Ding W, Mao J, Chen M, Sheng Z.
europepmc +1 more source
Bisphenol S impairs courtship, grooming, and locomotor behaviors in <i>Drosophila melanogaster</i>. [PDF]
Mahyar Z +10 more
europepmc +1 more source
Good to excellent reliability of instrumented ankle passive resistance and strength measurements in children. [PDF]
Åhblom A +5 more
europepmc +1 more source
MaxEnt model-based prediction of potential suitable habitats of three Trichosanthes L. species in China under future climate change scenarios. [PDF]
Wang X +5 more
europepmc +1 more source
MicroAge mission: experimental design and hardware for a bespoke culture system supporting tissue-engineered skeletal muscle. [PDF]
Jones SW +15 more
europepmc +1 more source
Related searches:
AbstractWe propose a new parameter for studying the cohesiveness of graphs. The parameter is based on a technique for coding points by their images under various contractions. We find the value of this parameter for various classes of graphs, and investigate its behavior under three graphical products.
exaly +2 more sources
Contractible Edges and Contractible Triangles in a 3-Connected Graph
Graphs and Combinatorics, 2021For a 3-connected graph \(G\), an edge (resp. a triangle) of \(G\) is a 3-contractible edge (resp. a 3-contractible triangle) if the graph obtained from \(G\) by contracting it is also a 3-connected graph. Let \(E_c(G), \mathcal{T}_c(G)\) be the set of 3-contractible edges of \(G\) and the set of 3-contractible triangles of \(G\), respectively. In this
Kiyoshi Ando, Yoshimi Egawa
openaire +2 more sources
The Complexity of Graph Contractions
2003For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H. We continue a line of research that was started in 1987 by Brouwer & Veldman, and we determine the computational complexity of H-CONTRACTIBILITY for certain classes of pattern graphs.
Asaf Levin +2 more
openaire +2 more sources
On systolic contractions of program graphs
IEEE Transactions on Computers, 1989A variant of the mapping problem, namely, systolic contractions of program graphs, is considered. The notion of time links is introduced to mechanize the contraction process; the timing of information flow between processors is modeled in terms of fundamental loop and path equations of delays and is optimized using linear programming. While the results
Weicheng Shen, A. Yavuz Oruç
openaire +1 more source

