论文信息 - Greedy algorithm and symmetric matroids

Greedy algorithm and symmetric matroids

Symmetric matroids are set systems which are obtained, in some sense, by a weakening of the structure of a matroid. These set systems are characterized by a greedy algorithm and they are suitable for dealing with autodual properties of matroids. Applications are given to the eulerian tours of 4-regular graphs and the theory ofg-matroids.

André Bouchet | A. Bouchet

[1] B. Korte,et al. Greedoids - A Structural Framework for the Greedy Algorithm , 1984 .

[2] D. Gale. Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[3] André Bouchet,et al. Isotropic Systems , 1987, Eur. J. Comb..

[4] André Bouchet,et al. Graphic presentations of isotropic systems , 1987, J. Comb. Theory, Ser. B.

[5] B. Korte,et al. An Analysis of the Greedy Heuristic for Independence Systems , 1978 .