Results 21 to 30 of about 16,183 (155)
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
FS^3: A Sampling based method for top-k Frequent Subgraph Mining [PDF]
, 2014 Mining labeled subgraph is a popular research task in data mining because of its potential application in many different scientific domains. All the existing methods for this task explicitly or implicitly solve the subgraph isomorphism task which is ...
Hasan, Mohammad Al, Saha, Tanay Kumar
core +3 more sources
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
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
Pattern matching and pattern discovery algorithms for protein topologies [PDF]
, 2001 We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
C. Bron +14 more
core +1 more source
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
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
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core
Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds
, 2016 Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols.
Azmy, Michael +2 more
core +1 more source
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