Results 51 to 60 of about 21,959 (221)
Dimer models and conformal structures
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Efficient Algorithms for Subgraph Listing
Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +1 more source
Defining Recursive Predicates in Graph Orders [PDF]
We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary.
Ramanathan S. Thinniyam
doaj +1 more source
On Multilevel Energy‐Based Fragmentation Methods
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
In order to implement a quantum circuit on an NISQ device, it must be transformed into a functionally equivalent circuit that satisfies the device’s connectivity constraints.
Yang Qian +3 more
doaj +1 more source
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
Link Prediction Based on Simple Path Graphs [PDF]
Link prediction is an important task in graph machine learning that aims to recover missing edges in graphs or predict potential future connections between nodes.
LI Zhiren, ZHENG Weiguo
doaj +1 more source
Rigidity of graph products of abelian groups
We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a ...
Gutierrez, Mauricio, Piggott, Adam
core +1 more source
This paper investigates how circuit representation, flat SPICE Netlists versus structured PySpice code, influences LLM performance in functional block recognition tasks. Using a benchmark of six analogue comparator circuits derived from a standard educational collection. Our results reveal that most models showed decreased performance on the structured
Andrei Dăescu +3 more
wiley +1 more source
Stable Matching Games: Manipulation via Subgraph Isomorphism [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Sushmita, Roy, Sanjukta
openaire +3 more sources

