InfoWorld

A practitioner’s primer on deterministic application modernization

How OpenRewrite uses Lossless Semantic Trees to deliver a full-fidelity representation of code, making transformations precise, repeatable, and auditable.
Scientific Research Publishing

Murakami, Y. (2024) The Burning Number Conjecture Is True for Trees without Degree-2 Vertices. Graphs and Combinatorics, 40, Article No. 82.

ABSTRACT: Graph burning is a model for describing the spread of influence in social networks and the burning number is a parameter used to describe the speed of information spread. In 2016, Bonato ...
Scientific Research Publishing

Chartrand, G., Okamoto, F. and Zhang, P. (2009) Rainbow Trees in Graphs and Generalized Connectivity. Networks, 55, 360-367.

ABSTRACT: The generalized k -connectivity κ k ( G ) and k -edge-connectivity λ k ( G ) of a graph G are a natural generalization of traditional connectivity κ( G ) and edge connectivity λ( G ) , ...
C&EN

ChemXTree: A Feature-Enhanced Graph Neural Network-Neural Decision Tree Framework for ADMET Prediction

Shanghai Frontiers Science Center of Artificial Intelligence and Deep Learning and NYU-ECNU Center for Computational Chemistry, NYU Shanghai, Shanghai 200062, China Department of Chemistry, New York ...
IEEE

Growing Like a Tree: Finding Trunks From Graph Skeleton Trees

Abstract: The message-passing paradigm has served as the foundation of graph neural networks (GNNs) for years, making them achieve great success in a wide range of applications. Despite its elegance, ...