Mtminer¶

Synopsis¶

mtminer computes levelwisely the minimal transversals of a hypergraph [1].

Input format¶

Each line is a hyper edge. Below two hyper edges, the first containing the vertices 1 and 2, the second has 2 and 3. The output give the minimal transversals with growing length, each one a line.

Example¶

$ cat > /tmp/test
1 2 
2 3 
^D
$ mtminer /tmp/test
2 
# depth 2
1 3 

C++ code¶

The code is avalaible below (mtminer-dist.tgz).

Reference¶

[1] Hébert C., Bretto A., Crémilleux B. A data mining formalization to improve hypergraph transversal computation, Fundamenta Informaticae, IOS Press, 80(4), pp. 415-433, 2007.