On 1/12/2010 12:12 AM, Johannes Hüsing wrote:
Tal Galili schrieb:
My specific problem is called:
Minimum vertex cover for a hypergraph
I know nothing about the problem at hand, but on the Wikipedia
page it says that the problem can be formulated as an integer
linear program. There is an R packages that interfaces to a
linear programming package (Rglpk), which may or may not
help you.
There are also two graph/network analysis packages available for R,
'igraph' and 'sna'. I don't think either of them has a formal support
for hypergraphs, but it is possible that they could be jerry-rigged to
solve your problem. Even if not, the people involved may be able to
help. For example, the igraph mailing list (igraph-h...@nongnu.org) is
pretty active and the developers are very helpful.
Best,
Magnus
______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
