Results 271 to 280 of about 168,763 (311)
Lightweight and Energy-Aware Intrusion Detection for Industrial IoT Using TinyML and Edge AI. [PDF]
Sci RepNassef L +7 more
europepmc +1 more source
Non-lytic protein secretion by virulence-associated Type 10 Secretion Systems in <i>Salmonella enterica</i>. [PDF]
Front MicrobiolMahankali S, Geiger T.
europepmc +1 more source
In-network multidisciplinary digital care improves outcomes in medicare advantage members with musculoskeletal diagnoses. [PDF]
Front Digit HealthCross AG +4 more
europepmc +1 more source
Prospective evaluation of occlusion time and force distribution in implant-supported fixed prostheses using the T-scan. [PDF]
Front Dent MedRaj S, Shetty M, Hegde C.
europepmc +1 more source
Research on structural damage identification based on temporal power flow graph network. [PDF]
Sci RepWu X +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Random Structures & Algorithms, 2005
AbstractWe study here lifts and random lifts of graphs, as defined by Amit and Linial (Combinatorica 22 (2002), 1–18). We consider the Hadwiger number η and the Hajós number σ of ℓ‐lifts of Kn and analyze their extremal as well as their typical values (that is, for random lifts). When ℓ = 2, we show that ${n \over 2} \leq \eta \leq n$, and random lifts
Yotam Drier, Nathan Linial
openaire +2 more sources
AbstractWe study here lifts and random lifts of graphs, as defined by Amit and Linial (Combinatorica 22 (2002), 1–18). We consider the Hadwiger number η and the Hajós number σ of ℓ‐lifts of Kn and analyze their extremal as well as their typical values (that is, for random lifts). When ℓ = 2, we show that ${n \over 2} \leq \eta \leq n$, and random lifts
Yotam Drier, Nathan Linial
openaire +2 more sources
Journal of Graph Theory, 2005
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.
Guantao Chen +4 more
openaire +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.
Guantao Chen +4 more
openaire +2 more sources