-
1
A kernelization algorithm for d-Hitting Set
Published 2010“…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. …”
Get full text
Get full text
Get full text
article -
2
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
3
-
4
Using C++ to Calculate SO(10) Tensor Couplings
Published 2021“…The software is capable of accepting invariant couplings involving an arbitrary number of SO(10) Higgs tensors, each having up to five indices. …”
Get full text
article