C&EN

Cutting Materials in Half: A Graph Theory Approach for Generating Crystal Surfaces and Its Prediction of 2D Zeolites

§ Department of Chemistry, University College London, 20 Gordon Street, London WC1H 0AJ, U.K. ∥ Laboratory of Molecular Simulation, Institut des Sciences et Ingénierie Chimiques, Valais, École ...
IEEE

A Maximum Flow Routing Algorithm for Multi-Unmanned Surface Vessel Networks

Abstract: Based on Storage Time Aggregated Graph (STAG) model in time-varying graph theory, we investigate the single-source-single-sink maximum flow problem in a time-varying Ad hoc network comprised ...
acm.org

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
IEEE

Maximum Flow Routing Strategy for Space Information Network With Service Function Constraints

Abstract: In this paper, we investigate the maximum flow routing strategy with the service function chain (SFC) constraints in the space information networks (SINs), where a SFC consists of a specific ...
Frontiers

Energy Landscape for the Membrane Fusion Pathway in Influenza A Hemagglutinin From Discrete Path Sampling

The conformational change associated with membrane fusion for Influenza A Hemagglutinin is investigated with a model based upon pre- and post-fusion structures of the HA2 component. We employ ...
C&EN

Graph Neural Networks for Prediction of Fuel Ignition Quality

Prediction of combustion-related properties of (oxygenated) hydrocarbons is an important and challenging task for which quantitative structure–property relationship (QSPR) models are frequently ...