Results 21 to 30 of about 57,468 (218)
3/2 Firefighters are not enough [PDF]
, 2010 The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic.
Berlekamp +16 more
core +1 more source
Small grid embeddings of 3-polytopes [PDF]
, 2009 We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$.
A. Ribó Mor +35 more
core +3 more sources
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 +15 more
core +2 more sources
The looping rate and sandpile density of planar graphs [PDF]
, 2015 We give a simple formula for the looping rate of loop-erased random walk on a finite planar graph. The looping rate is closely related to the expected amount of sand in a recurrent sandpile on the graph.
Kassel, Adrien, Wilson, David B.
core +1 more source
A Mesh-Based Typification Method for Building Groups with Grid Patterns
ISPRS International Journal of Geo-Information, 2019 Building groups with special patterns are common layouts in urban settlement areas, which should be carefully generalized. Typification is considered as an appropriate operator to generalize building groups with grid patterns. As an important operator in
Xiao Wang, Dirk Burghardt
doaj +1 more source
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ć +2 more
openaire +1 more source
The Complexity of Simultaneous Geometric Graph Embedding [PDF]
, 2015 Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi: V \to P$ such ...
Cardinal, Jean, Kusters, Vincent
core +1 more source
Plug-and-play Solvability of the Power Flow Equations for Interconnected DC Microgrids with Constant Power Loads [PDF]
, 2019 In this paper we study the DC power flow equations of a purely resistive DC power grid which consists of interconnected DC microgrids with constant-power loads.
De Persis, Claudio +2 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 +1 more
core +2 more sources