Dimitri
Matriods are generalization of vector spaces. Basically, they are
defined by a set of linear dependence axioms and basis exchange
properties. Oxley's "Matriod Theory" is the standard reference. There
are a multitude of equivalent formulations.
Mike Matsko
----- Original Message -----
From: Dmitri Pissarenko
Hello!
Recently I had a course on matroids and would like to investigate
Gerhard Navratil wrote: the> topic a little further. Did anybody write (or start writing) a
Haskell-implementation for matroids?
What is a matroid?
Thanks
Dmitri Pissarenko -- Dmitri Pissarenko Software Engineer http://dapissarenko.com _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks! -- Dmitri Pissarenko Software Engineer http://dapissarenko.com
On Fri, 14 Jan 2005, Michael Matsko wrote:
Dimitri
Matriods are generalization of vector spaces. Basically, they are defined by a set of linear dependence axioms and basis exchange properties. Oxley's "Matriod Theory" is the standard reference. There are a multitude of equivalent formulations.
... and the most spectacular result is, that a greedy algorithm for a problem is optimal if and only if the problem has Matroid structure.
participants (3)
-
Dmitri Pissarenko -
Henning Thielemann -
Michael Matsko