-
1
A kernelization algorithm for d-Hitting Set
Published 2010“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
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