R help - Jan 2010 - Solving graph theory problems with R ? (minimum vertex cover)

I just realized (after many discussion with friends), that I might need to
solve a (classical) graph theory problem with R.
My specific problem is called:
Minimum vertex cover
<http://en.wikipedia.org/wiki/Vertex_cover#Definition> for
a hypergraph <http://en.wikipedia.org/wiki/Hypergraph> (Please see the
links
for a formal explanation, also with some pictures)
Which is another way of saying "I have a graph with nodes and lines (when
the same line connects multiple nodes), and I wish to find the minimum set
of nodes so that this set of nodes will use all the lines in the graph."
I understand that this is considered a very basic question in graph theory,
and I would like to solve it with R.

I wasn't able to find anything about it in my searches.
Can anyone suggest any lead?

Many thanks,
Tal






----------------Contact
Details:-------------------------------------------------------
Contact me: Tal.Galili@gmail.com |  972-52-7275845
Read me: www.talgalili.com (Hebrew) | www.biostatistics.co.il (Hebrew) |
www.r-statistics.com/ (English)
----------------------------------------------------------------------------------------------

	[[alternative HTML version deleted]]

Tal Galili schrieb:
> I just realized (after many discussion with friends), that I might need to
> solve a (classical) graph theory problem with R.
> My specific problem is called:
> Minimum vertex cover
<http://en.wikipedia.org/wiki/Vertex_cover#Definition> for
> a hypergraph <http://en.wikipedia.org/wiki/Hypergraph> (Please see
the links
> for a formal explanation, also with some pictures)
>   
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.