Sign Up to like & get
recommendations!
0
Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2895296
Abstract: Using the hypergraphs as the central data structure in dynamic discrete association problems is a common practice. The computation of minimal transversals (i.e., the family of all minimal hitting sets) in those hypergraphs is a…
read more here.
Keywords:
computation algorithms;
transversal computation;
symbolic learning;
computation ... See more keywords