Results 281 to 290 of about 405,092 (308)

Microbial succession in human tissues postmortem: insights from 2bRAD-M sequencing. [PDF]

Microbiol Spectr
Huang X, Zeng J, Yang F, Liu Y, Chen J, Wang H, Li S, Li C, Zhang S.   +8 more
europepmc   +1 more source

Low-energy tetrahedral networks for carbon and silicon from (2+1)-regular bipartite-like graphs. [PDF]

IUCrJ
Wei Y, Li S, Shi X, He C.
europepmc   +1 more source

Fast graph convolutional models incorporating matrix factorization for predicting microbe-disease associations. [PDF]

Sci Rep
Wu Q, Tang S.
europepmc   +1 more source

Welfare optimization for resource allocation with peer effects. [PDF]

PNAS Nexus
Qiu Z, Rosenkrantz DJ, Jackson MO, Levin SA, Ravi SS, Stearns RE, Marathe MV.   +6 more
europepmc   +1 more source

Intelligent fault prediction and diagnosis for wind-powered heating systems using graph neural networks. [PDF]

Sci Rep
Wang Y, Zhao J, Tang D, Zhao W, Huang S.
europepmc   +1 more source

Physics-Informed GCN-LSTM Framework for Long-Term Forecasting of 2D and 3D Microstructure Evolution

Razavi H, Moelans N.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Graph Decomposition of Slim Graphs

Graphs and Combinatorics, 1999
Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Caro, Yair, Yuster, Raphael
openaire   +2 more sources

Graph Ear Decompositions and Graph Embeddings

SIAM Journal on Discrete Mathematics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer, Kanchi, Saroja P.
openaire   +1 more source

Induced Decompositions of Graphs

Journal of Graph Theory, 2012
AbstractWe consider those graphs G that admit decompositions into copies of a fixed graph F, each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We discuss the cases where F is a complete equipartite graph, a cycle,
Bondy, J. Adrian, Szwarcfiter, Jayme L.
openaire   +2 more sources

P4-decompositions of regular graphs

Journal of Graph Theory, 1999
It is shown that every simple \(r\)-regular graph \(G\) admits a balanced \(P_4\)-decomposition if \(r \equiv 0\pmod 3\) and \(G\) has no cut-edge when \(r\) is odd. It is also shown that a connected 4-regular graph \(G\) admits a \(P_4\)-decomposition if and only if \(| E(G)| \equiv 0\pmod 3\) by characterizing graphs of maximum degree 4 that admit a ...
Heinrich, Katherine, Liu, Jiping, Yu, Minli   +2 more
openaire   +2 more sources