Results 301 to 310 of about 10,813,555 (336)

Highway Crossing Rates of Wild Felids Before, During, and After Wildlife Crossing Structure Installation. [PDF]

Ecol Evol
Lehnen SE, Sternberg MA, Swarts HM, Young JH, Hanley V, Kline RJ.   +5 more
europepmc   +1 more source

The construction of student-centered artificial intelligence online music learning platform based on deep learning. [PDF]

Sci Rep
Xia R, Li J, Li H.
europepmc   +1 more source

Quinonoid radial π-conjugation. [PDF]

Chem Sci
Bhattacharjee R, Tovar JD, Kertesz M.
europepmc   +1 more source

Infralimbic parvalbumin neural activity facilitates cued threat avoidance. [PDF]

Elife
Ho YY, Yang Q, Boddu P, Bulkin DA, Warden MR.   +4 more
europepmc   +1 more source

Human saliva exerts strong type-dependent effects on adenovirus infectivity. [PDF]

Front Immunol
Sallard E, Zhang W, Chilakamarri N, Farzanehkari S, Seuthe IMC, Ehrhardt A, Aydin M.   +6 more
europepmc   +1 more source

White matter geometry confounds Diffusion Tensor Imaging Along Perivascular Space (DTI-ALPS) measures

Schilling KG, Newton A, Tax C, Nilsson M, Chamberland M, Anderson A, Landman B, Descoteaux M.   +7 more
europepmc   +1 more source

Testing an Innovative Gait Training Program in Immersive Virtual Reality for Healthy Older Adults: Protocol for a Randomized Controlled Trial.

JMIR Res Protoc
Mascret N, Delbes L, Goulon C, Montagne G.   +3 more
europepmc   +1 more source

On Hardness of the Joint Crossing Number

International Symposium on Algorithms and Computation, 2015
The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized.
Petr Hliněný, G. Salazar
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

Algorithmica, 2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds.
Sergio Cabello, B. Mohar
semanticscholar   +2 more sources