论文信息 - Basis graphs of greedoids and two-connectivity

Basis graphs of greedoids and two-connectivity

Pivoting, i.e. exchanging exactly one element in a basis, is a fundamental step in the simplex algorithm for linear programming. This operation has a combinatorial analogue in matroids and greedoids. In this paper we study pivoting for bases of greedoids. We show that for 2-connected greedoids any basis can be obtained from any other by a (finite) sequence of pivots.

László Lovász | Bernhard Korte | B. Korte | L. Lovász

[1] L. Lovász. A homology theory for spanning tress of a graph , 1977 .

[2] W. Pulleyblank. Progress in combinatorial optimization , 1985 .

[3] F. Harary,et al. On the Tree Graph of a Matroid , 1972 .

[4] M. D. Tobey,et al. A Graphical Representation of Matroids , 1973 .

[5] László Lovász,et al. Structural properties of greedoids , 1983, Comb..

[6] Robin Wilson,et al. Graph theory and combinatorics , 1979 .

[7] Stephen B. Maurer. Matroid basis graphs. II , 1973 .

[8] László Lovász,et al. Homotopy properties of greedoids , 1985 .

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

[10] László Lovász,et al. Mathematical Structures Underlying Greedy Algorithms , 1981, International Symposium on Fundamentals of Computation Theory.

[11] R. Cummins. Hamilton Circuits in Tree Graphs , 1966 .

[12] W. T. Tutte,et al. Graph theory and related topics , 1979 .