Results 21 to 30 of about 40,667 (118)

Maker-Breaker-Crossing-Game on the Triangular Grid-graph

, 2022
We study the $(p,q)$-Maker Breaker Crossing game introduced by Day and Falgas Ravry in 'Maker-Breaker percolation games I: crossing grids'. The game described in their paper involves two players Maker and Breaker who take turns claiming p and q as yet unclaimed edges of the graph respectively. Maker aims to make a horizontal path from a leftmost vertex
openaire   +2 more sources

Some new characterizations of Hamiltonian cycles in triangular grid graphs

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Bodroža-Pantić, Harris Kwong, Milan Pantić   +2 more
openaire   +1 more source

On the non-ergodicity of the Swendsen-Wang-Kotecky algorithm on the kagome lattice [PDF]

, 2010
We study the properties of the Wang-Swendsen-Kotecky cluster Monte Carlo algorithm for simulating the 3-state kagome-lattice Potts antiferromagnet at zero temperature.
Altschulter A, Bojan Mohar, Bremaud P, Burton J K, Ferreira S J, Fisk S, Fortuin C M, Gibbons A, Jerrum M, Jesús Salas, Kasteleyn P W, Landau D P, Mohar B, Mohar B, Privman V, Sokal A D   +15 more
core   +2 more sources

Hierarchical path-finding for Navigation Meshes (HNA*) [PDF]

, 2016
Path-finding can become an important bottleneck as both the size of the virtual environments and the number of agents navigating them increase. It is important to develop techniques that can be efficiently applied to any environment independently of its ...
Fuentes, Carlos, Pelechano Gómez, Núria   +1 more
core   +2 more sources

Word-representability of subdivisions of triangular grid graphs

, 2015
A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells.
Chen, Zongqing, Kitaev, Sergey, Sun, Brian Y.   +2 more
openaire   +2 more sources

Integrable lattices and their sublattices II. From the B-quadrilateral lattice to the self-adjoint schemes on the triangular and the honeycomb lattices

, 2007
An integrable self-adjoint 7-point scheme on the triangular lattice and an integrable self-adjoint scheme on the honeycomb lattice are studied using the sublattice approach.
A. Doliwa, Baxter R. J., Dynnikov I. A., M. Nieszporski, P. M. Santini, Sauer R., Senechal M.   +6 more
core   +1 more source

Multiloop functional renormalization group that sums up all parquet diagrams [PDF]

, 2018
We present a multiloop flow equation for the four-point vertex in the functional renormalization group (fRG) framework. The multiloop flow consists of successive one-loop calculations and sums up all parquet diagrams to arbitrary order.
Kugler, Fabian B., von Delft, Jan
core   +3 more sources

Fast domino tileability [PDF]

, 2016
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area.
Pak, Igor, Sheffer, Adam, Tassy, Martin
core   +3 more sources

The equitable non-split domination number of graphs

Mathematics in Applied Sciences and Engineering
Finding a group of dominant servers is a necessary step towards optimising service provisioning to all clients in the complex world of server-client networks. This crucial decision rests on the non-split dominance number in the graph architecture.
Samuel Jebisha Esther, Valiyaveettil Abdul Naseema, Joseph Veninstine Vivik   +2 more
doaj   +1 more source

Sparse 3D convolutional neural networks

, 2015
We have implemented a convolutional neural network designed for processing sparse three-dimensional input data. The world we live in is three dimensional so there are a large number of potential applications including 3D object recognition and analysis ...
Graham, Ben
core   +1 more source