This repository contains code for Graph Neural ODE++. This work was completed as part of CPSC 483: Deep Learning on Graph-Structured Data. We propose Graph Neural ODE++, an improved paradigm for Graph ...
Abstract: To solve connected dominating problem, it is necessary to find minimum connected dominating set (MCDS for short). However, to find MCDS is NP-hardness. So, a model of graphs called interval ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results