Graph algorithms - Open Access .click

Results 61 to 70 of about 832,460 (272)

Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs

Scientific Reports, 2023
Counting number of triangles in the graph is considered a major task in many large-scale graph analytics problems such as clustering coefficient, transitivity ratio, trusses, etc.
Ahmed Sharafeldeen, Mohammed Alrahmawy, Samir Elmougy +2 more
doaj +1 more source

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source

Automating Lexical Graph Construction with Large Language Models: A Scalable Approach to Japanese Multi-Relation Lexical Networks

Knowledge
In recent advancements within natural language processing (NLP), lexical networks play a crucial role in representing semantic relationships between words, enhancing applications from word sense disambiguation to educational tools.
Benedikt Perak, Dragana Špica
doaj +1 more source

Tree Compatibility, Incomplete Directed Perfect Phylogeny, and Dynamic Graph Connectivity: An Experimental Study

Algorithms, 2019
We study two problems in computational phylogenetics. The first is tree compatibility. The input is a collection of phylogenetic trees over different partially-overlapping sets of species.
David Fernández-Baca, Lei Liu
doaj +1 more source

A Genetic Algorithm for the Maximum 2–Packing Set Problem

International Journal of Applied Mathematics and Computer Science, 2020
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality.
Trejo-Sánchez Joel Antonio +2 more
doaj +1 more source

Signal Flow Graph Approach to Efficient DST I-IV Algorithms [PDF]

, 2016
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices.
Perera, Sirani M.
core +2 more sources

Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz +11 more
wiley +1 more source

Graph Representations for Reinforcement Learning

Journal of Computer Science and Technology
Graph analysis is becoming increasingly important due to the expressive power of graph models and the efficient algorithms available for processing them.
Esteban Schab, Carla Casanova, Fabiana Piccoli +2 more
doaj +1 more source

Diffusion Spectrum Imaging Maps Early Axonal Loss and a Unique Progressive Signal in Neuronal Intranuclear Inclusion Disease

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source

Minimum 2-vertex strongly biconnected spanning directed subgraph problem [PDF]

Discrete Mathematics Letters, 2021
Raed Jaberi
doaj +1 more source

graph theory