Plans regarding finding minimal hypergraph transversals.
More...
Go to the source code of this file.
Detailed Description
Plans regarding finding minimal hypergraph transversals.
 Todo:
 Connections
 Todo:
 Transfer
 Todo:
 Testing

okltest_transversal_hg should be a generic test for computing the transversal hypergraph (used for all different methods). Further testcases:

Clawgraphs.

Complete graphs (and complete rgraphs).

Graphs without edges.
It seems superfluous to also have a dedicated testfunction for the independence hypergraph (i.e., that check should just transfer the test to the transversaltest)? See below.
 Todo:
 transversal_hg

Performance on complete graphs:

Likely this performs badly.

And this likely holds for all splitting strategies.

For example when adding one edge after another, starting with the empty edgeset and completing with all edges, there should be always some graph in the sequence with large transversal hypergraph.
Definition in file general.hpp.