Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5353| Title: | Some Abstract Pivot Algorithms (REVISED) |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which is applied to prove a number of generalized exchange properties for bases. Supported in part by the U.S. Army Research Office (Durham) under Contract No. DAHCO4-73-0032 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/5353 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.