Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...
Abstract: In this paper, closed-form discrete Gaussian functions are proposed. The first property of these functions is that their discrete Fourier transforms are still discrete Gaussian functions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback