Results 251 to 260 of about 382,145 (280)
Genetic prediction with ARG-powered linear algebra. [PDF]
GeneticsLee H +4 more
europepmc +1 more source
Evolution Equations on Co-evolving Graphs: Long-Time Behaviour and the Graph-Continuity Equation. [PDF]
J Nonlinear SciCarrillo JA, Esposito A, Mikolás L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On highly ramsey infinite graphs
Journal of Graph Theory, 2008AbstractWe show that, for r ≥ 2 and k ≥ 3, there exists a positive constant c such that for large enough n there are 2 non‐isomorphic graphs on at most n vertices that are r‐ramsey‐minimal for the odd cycle C2k+1. © 2008 Wiley Periodicals, Inc.
openaire +2 more sources
1990
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Infinite Feature Selection: A Graph-based Feature Filtering Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Giorgio Roffo +2 more
exaly
All countable monoids embed into the monoid of the infinite random graph
Discrete Mathematics, 2010Anthony Bonato, Igor Dolinka
exaly