Mtminer » Historique » Version 8
François Rioult, 13/02/2012 18:45
| 1 | 1 | François Rioult | h1. Mtminer |
|---|---|---|---|
| 2 | |||
| 3 | h2. Synopsis |
||
| 4 | |||
| 5 | 7 | François Rioult | @mtminer@ computes levelwisely the minimal transversals of a hypergraph [1]. |
| 6 | 1 | François Rioult | |
| 7 | 4 | François Rioult | h2. Input format |
| 8 | |||
| 9 | 6 | François Rioult | 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. |
| 10 | 4 | François Rioult | |
| 11 | 1 | François Rioult | h2. Example |
| 12 | |||
| 13 | <pre> |
||
| 14 | $ cat > /tmp/test |
||
| 15 | 1 2 |
||
| 16 | 2 3 |
||
| 17 | ^D |
||
| 18 | $ mtminer /tmp/test |
||
| 19 | 2 |
||
| 20 | # depth 2 |
||
| 21 | 1 3 |
||
| 22 | </pre> |
||
| 23 | 2 | François Rioult | |
| 24 | h2. Reference |
||
| 25 | |||
| 26 | 5 | François Rioult | [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. |