Results 111 to 120 of about 3,327 (143)

Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs

Journal of Graph Theory, 2003
AbstractIn this paper, we show that if G is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either G has an Eulerian subgraph H such that $S \subseteq V(H)$, or G can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen graph contains at least one vertex in S.
Chen, Zhi-Hong   +4 more
openaire   +3 more sources

Knowledge Graphs

ACM Computing Surveys, 2022
Aidan Hogan   +2 more
exaly  

Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm

Nature Methods, 2021
Haoyu Cheng   +2 more
exaly  

Foundation models for generalist medical artificial intelligence

Nature, 2023
, Harlan M Krumholz, Jure Leskovec
exaly  

Home - About - Disclaimer - Privacy