Results 261 to 270 of about 5,759,724 (297)

HEXB as a Candidate Target Gene in Keloid Radiotherapy: Based on Multi-Omics Analysis and Mendelian Randomization. [PDF]

Clin Cosmet Investig Dermatol
Shang Y, Gao S, Guan X.
europepmc   +1 more source

An Interpretable and Edge Deployable Spatio-Temporal Trajectory Prediction for Autonomous Driving. [PDF]

Sensors (Basel)
Megalingam RK, Selvarajan NP, Vijay P.
europepmc   +1 more source

Classification of sporadic Creutzfeldt-Jakob disease based on resting state scalp-recorded electroencephalogram-derived indices. [PDF]

PLoS One
Takeoka C, Yada T, Yamazaki T, Kuroiwa Y, Hirai T, Fujino K, Mizusawa H, Takao M, Terao Y, Yamada M.   +9 more
europepmc   +1 more source

Advanced quantum computing-driven digital twin for energy and timing optimization in low-power VLSI circuits &IoT devices. [PDF]

Sci Rep
Mujahid MM, Jose D.
europepmc   +1 more source

A thermodynamically consistent approach to modeling epithelial solute and water transport in the proximal convoluted tubule. [PDF]

J Biol Phys
Noroozbabaee L, Dowrick JM, Blanco PJ, Nickerson DP.   +3 more
europepmc   +1 more source

Causal spectral segmenter: counterfactual graph reasoning for weakly supervised pathology segmentation. [PDF]

Bioinformatics
Zhang X, Si J, Lu W, Li C, Zhang X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the power graph and the reduced power graph of a finite group

Communications in Algebra, 2019
In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph).
Rajendran Rajkumar, Anitha Thangamani
exaly   +2 more sources

On the Power of Graph Searching for Cocomparability Graphs

SIAM Journal on Discrete Mathematics, 2016
Summary: In this paper we study how graph searching on a cocomparability graph \(G\) can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of \(\overline{G}\)) that yield simple algorithms for various intractable problems in general.
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkerhard   +3 more
openaire   +3 more sources

Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics, 2003
Summary: We give nontrivial bounds for the inductiveness or degeneracy of power graphs \(G^{k}\) of a planar graph \(G\). This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Geir Agnarsson, Magnús M. Halldórsson
openaire   +5 more sources