13 citations · 21 across the 5 of their papers we have counts for
6 papers
Proper edge colorings of planar graphs with rainbow -s
András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1
We call a proper edge coloring of a graph a B-coloring if every 4-cycle of is colored with four different colors. Let denote the smallest number of colors needed f…
STDP Learning of Image Patches with Convolutional Spiking Neural Networks
Daniel J. Saunders, Hava T. Siegelmann, Robert Kozma +1
Spiking neural networks are motivated from principles of neural systems and may possess unexplored advantages in the context of machine learning. A class of \textit{convolutional s…
On randomly generated intersecting hypergraphs II
Tom Bohman, Alan Frieze, Ryan R. Martin +2
Let be a positive constant. Suppose that and the members of are chosen sequentially at random to form an intersecting hypergraph .…
On randomly generated intersecting hypergraphs
Tom Bohman, Colin Cooper, Alan Frieze +2
Let be a positive constant. We show that if and the members of are chosen sequentially at random to form an intersecting hypergraph…
A modified bootstrap percolation on a random graph coupled with a lattice
Svante Janson, Robert Kozma, Miklós Ruszinkó +1
In this paper a random graph model is introduced, which is a combination of fixed torus grid edges in and some additional ran…
Accelerating unstructured finite volume computations on field-programmable gate arrays
Zoltan Nagy, Csaba Nemes, Antal Hiba +4
Accurate simulations of various physical processes on digital computers requires huge computing performance, therefore accelerating these scientific and engineering applications ha…