Results 241 to 250 of about 125,344 (284)
The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. [PDF]
Dang DC, Lehre PK.
europepmc +1 more source
A unified framework for robust 3D watermarking based on feature integration. [PDF]
Hu J, Dai M, Liang T, Xie Q, Wang X.
europepmc +1 more source
Delocalisation and Continuity in 2D: Loop O ( 2 ) , Six-Vertex, and Random-Cluster Models. [PDF]
Glazman A, Lammers P.
europepmc +1 more source
Distance domination in vertex partitioned graphs
Frendrup, Allan +2 more
openaire +1 more source
Corrigendum to "Computing degree based topological indices of algebraic hypergraphs" [Heliyon Volume 10, Issue 15, August 2024, e34696]. [PDF]
Alali AS +4 more
europepmc +1 more source
Billi: Provably Accurate and Scalable Bubble Detection in Pangenome Graphs
Bhat SG, Mahajan D, Jain C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Partition Function of the Eight-Vertex Lattice Model
Annals of Physics, 1972The partition function of the zero-field “Eight-Vertex” model on a square M by N lattice is calculated exactly in the limit of M, N large. This model includes the dimer, ice and zero-field Ising, F and KDP models as special cases. In general the free energy has a branch point singularity at a phase transition, with an irrational exponent.
openaire +4 more sources
Combinatorics, Probability and Computing, 2003
Let σ be a finite relational signature, let be a set of finite complete relational structures of signature σ, and let be the countable homogeneous relational structure of signature σ which does not embed any of the structures in .When σ consists of at most binary relations and is finite, the vertex partition behaviour of is completely analysed, in ...
openaire +1 more source
Let σ be a finite relational signature, let be a set of finite complete relational structures of signature σ, and let be the countable homogeneous relational structure of signature σ which does not embed any of the structures in .When σ consists of at most binary relations and is finite, the vertex partition behaviour of is completely analysed, in ...
openaire +1 more source
Distant Vertex Partitions of Graphs
Combinatorics, Probability and Computing, 1998We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for
openaire +1 more source

