Advertisement

Matroids

  • L. R. Foulds
Part of the Universitext book series (UTX)

Abstract

Consider a finite set of vectors over an arbitrary field. Of course, each subset of this set is either linearly independent or linearly dependent. Also, any subset of a linearly independent subset of the original set is itself linearly independent. Further, if I and J are two linearly independent subsets of the original subset with |I|=|J|+1, then there exists an element of I which, together with J, forms a linearly independent set of |I| vectors.

Keywords

Span Tree Greedy Algorithm Independent Subset Minimum Span Tree Problem Nonnegative Weight 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • L. R. Foulds
    • 1
  1. 1.Department of Management SystemsUniversity of WaikatoHamiltonNew Zealand

Personalised recommendations