Results 241 to 250 of about 946,691 (269)
Some of the next articles are maybe not open access.

What Is between Chordal and Weakly Chordal Graphs?

2008
An (h ,s ,t )-representation of a graph G consists of a collection of subtrees {S v | v *** V (G )} of a tree T , such that (i) the maximum degree of T is at most h , (ii) every subtree has maximum degree at most s , and (iii) there is an edge between two vertices in the graph if and only if the corresponding subtrees in T have at least t vertices in ...
Elad Cohen   +3 more
openaire   +1 more source

Knowledge Graphs

ACM Computing Surveys, 2022
Aidan Hogan   +2 more
exaly  

The AME 2020 atomic mass evaluation (II). Tables, graphs and references*

Chinese Physics C, 2021
Meng Wang, Filip Kondev, Sarah Naimi
exaly  

Succinct Data Structures for Chordal Graphs

International Symposium on Algorithms and Computation, 2018
J. Munro, Kaiyu Wu
semanticscholar   +1 more source

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

Nature Methods, 2021
Haoyu Cheng   +2 more
exaly  

Use of directed acyclic graphs (DAGs) to identify confounders in applied health research: review and recommendations

International Journal of Epidemiology, 2021
Peter W G Tennant   +2 more
exaly  

Knowledge Graphs: Opportunities and Challenges

Artificial Intelligence Review, 2023
Feng Xia
exaly  

Multiplex de Bruijn graphs enable genome assembly from long, high-fidelity reads

Nature Biotechnology, 2022
Anton Bankevich   +2 more
exaly  

Semantic Knowledge Graphs for the News: A Review

ACM Computing Surveys, 2023
Andreas L Opdahl   +2 more
exaly  

Linear-Time Generation of Random Chordal Graphs

International/Italian Conference on Algorithms and Complexity, 2017
Oylum Şeker   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy