Ramsey numbers by stochastic algorithms with new heuristics
From MaRDI portal
Publication:6567678
Recommendations
Cites work
- scientific article; zbMATH DE number 432832 (Why is no real title available?)
- scientific article; zbMATH DE number 4106899 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 19184 (Why is no real title available?)
- scientific article; zbMATH DE number 42967 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 91001 (Why is no real title available?)
- scientific article; zbMATH DE number 3458662 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A lower bound for r(5, 5)
- A note on Ramsey multiplicity
- Backtrack Programming
- Combinatorial Relations and Chromatic Graphs
- Equation of state calculations by fast computing machines
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
- N(4, 4; 3)≥13
- On Parallel Searching
- On Two Classical Ramsey Numbers of the Form $R(3,n)$
- On a problem of formal logic.
- On the Ramsey numbers N(3,3,\dots ,3;2)
- On the congruence x^m+y^m z^m p.
- Optimization by simulated annealing
- Search algorithm for Ramsey graphs by union of group orbits
- Some remarks on the theory of graphs
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
This page was built for publication: Ramsey numbers by stochastic algorithms with new heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567678)
