Results 51 to 60 of about 17,360 (200)
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
TM-Miner: TFS-Based Algorithm for Mining Temporal Motifs in Large Temporal Network
IEEE Access, 2019 Temporal network is a basic tool for representing complex systems, such as communication networks and social networks; besides the temporal motif (TM) plays an important role in the analysis of temporal networks.
Xiaoli Sun +4 more
doaj +1 more source
Subgraph Isomorphism Algorithm Based on Color Coding [PDF]
, 2016 Tato práce popisuje řešení problému izomorfismu podgrafů pomocí techniky barevného kódování. V práci je popsán problém izomorfismu podgrafů, jeho varianty a jeho aplikace.
Malík Josef
core
WIREs Computational Molecular Science, Volume 16, Issue 1, January/February 2026.The scientist is hiking towards the treasure of accurate and predictive simulations of relevant phenomena. Molecular Dynamics shows a path riddled with obstacles such as accuracy, speed or sampling issues. Deep‐learning offers a way around these obstacles, but runs into hurdles of its own.
Klara Bonneau +15 more
wiley +1 more source
Induced Minor Free Graphs: Isomorphism and Clique-width
, 2016 Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +1 more source
Coxeter's enumeration of Coxeter groups
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In a short paper that appeared in the Journal of the London Mathematical Society in 1934, H. S. M. Coxeter completed the classification of finite Coxeter groups. In this survey, we describe what Coxeter did in this paper and examine an assortment of topics that illustrate the broad and enduring influence of Coxeter's paper on developments in ...
Bernhard Mühlherr, Richard M. Weiss
wiley +1 more source
Orthogonal polarity graphs and Sidon sets [PDF]
, 2014 Determining the maximum number of edges in an $n$-vertex $C_4$-free graph is a well-studied problem that dates back to a paper of Erd\H{o}s from 1938. One of the most important families of $C_4$-free graphs are the Erd\H{o}s-R\'enyi orthogonal polarity ...
Tait, Michael, Timmons, Craig
core
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Advanced Intelligent Discovery, Volume 1, Issue 3, December 2025.Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing
Online Academic Journal of Information Technology, 2018 As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil +3 more
doaj +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source