Results 81 to 90 of about 134 (105)
Grasping frequent subgraph mining for bioinformatics applications. [PDF]
BioData Min, 2018 Mrzic A +6 more
europepmc +1 more source
General-Purpose Models for the Chemical Sciences: LLMs and Beyond. [PDF]
Chem RevAlampara N +8 more
europepmc +1 more source
LUNAR: Automated Input Generation and Analysis for Reactive LAMMPS Simulations. [PDF]
J Chem Inf ModelKemppainen J +3 more
europepmc +1 more source
simona: a comprehensive R package for semantic similarity analysis on bio-ontologies. [PDF]
BMC GenomicsGu Z.
europepmc +1 more source
Dynamic Connectivity in Disk Graphs. [PDF]
Discrete Comput GeomBaumann A +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A GPU-Parallel Algorithm for Fast Hybrid BFS-DFS Graph Traversal
2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), 2017It seems natural to use the GPUs (Graphical Processing Units) for performing analytics on big graphs, due to the notable boost in high performance computing that their introduction has determined and to the huge volume of connected data that is being gathered and processed nowadays.
Maratea, Antonio +2 more
openaire +3 more sources
On the recognition of search trees generated by BFS and DFS
Theoretical Computer Science, 2022Robert Scheffler
exaly
Scalable and efficient graph traversal on high-throughput cluster
CCF Transactions on High Performance Computing, 2020Na Nie, Huawei Cao, Xiaochun Ye
exaly
Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations
2021Oded Green
exaly