Abstract: A vertex set D ⊆ V is considered a dominating set of G if every vertex in V − D is adjacent to at least one vertex in D. We called a dominating set D as a paired-dominating set if the ...

The maximum independent set problem is of central importance combinatorial optimization problem. It has many practical applications in science and engineering. In this paper, we propose a genetic ...

Computationally generating new synthetically accessible compounds with high affinity and low toxicity is a great challenge in drug design. Machine learning models beyond conventional pharmacophoric ...

Interactive scatter plot visualization built with D3.js. Displays data points using SVG circles with dynamic scales and axes. Ideal for understanding relationships between two numerical variables. - ...