Fear learning and generalization in youth with early-stage transdiagnostic psychiatric symptoms and the impact of acute exercise. [PDF]
Jennen L +6 more
europepmc +1 more source
Optimization of Health Service Utilization Among Elderly People With Chronic Diseases in Rural Ethnic Minorities in Northwest Yunnan Using Graph Neural Networks. [PDF]
Zhang J, Fan H.
europepmc +1 more source
Comparison of Robot-assisted Enhanced-view Totally Extraperitoneal (eTEP) and Transabdominal Retromuscular (TARM aka TARUP) Ventral Hernia Mesh Repair: A Systematic Review and Meta-Analysis. [PDF]
Brucchi F +4 more
europepmc +1 more source
Epidemiological intricacies of respiratory pathogens: a single-center study on infection dynamics in Beijing, 2023-2024. [PDF]
Jie W +6 more
europepmc +1 more source
Implementation of good clinical practice in clinical research in the context of limited resources settings: Lessons learnt from the freeBILy trial using an embedded mixed methods approach. [PDF]
Gunga L +21 more
europepmc +1 more source
Related searches:
Eulerian and even-face ribbon graph minors
Discrete Mathematics, 2020In this paper, we introduce Eulerian and even-face ribbon graph minors. These minors preserve Eulerian and even-face properties of ribbon graphs, respectively.
Metrose Metsidik
exaly +2 more sources
AbstractBollobás and Thomason showed that every 22k‐connected graph is k‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a K minor is 3‐linked.
Florian Pfender, Bing Wei
exaly +3 more sources
Directed Graph Minors and Serial-Parallel Width [PDF]
Graph minors are a primary tool in understanding the structure of undirected graphs, with many conceptual and algorithmic implications. We propose new variants of directed graph minors and directed graph embeddings, by modifying familiar definitions. For
Argyrios Deligkas, R. Meir
semanticscholar +2 more sources
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
Treewidth, Kernels, and Algorithms, 2020In the Disjoint Paths problem, the input consists of an n-vertex graph G and a collection of k vertex pairs, \(\{(s_i,t_i)\}_{i=1}^k\), and the objective is to determine whether there exists a collection \(\{P_i\}_{i=1}^k\) of k pairwise vertex-disjoint ...
D. Lokshtanov, Saket Saurabh, M. Zehavi
semanticscholar +1 more source

