Discrete Graph Diffusion DDGD, discrete graph diffusion is a diffusion model that is able to generate graphs and uses a discrete categorical distribution instead of a gaussian to add noise to the ...

While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale ...

In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To apply it to ...

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area. Topics to be covered include: Brief ...

Graphs and Trees This repository contains the solution for Lab 4: Graphs and Trees, assigned for the (CSE214) Discrete Structures course. The assignment consists of three main tasks related to graphs ...

Moreover, the adaptation of classical Li–Yau inequalities to discrete settings has established rigorous links between curvature dimension conditions and optimal transport methods on graphs ...

Article citations More>> S. Skiena, “Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica,” Addison-Wesley, Reading, 1990. has been cited by the following article: TITLE: ...