Indexed metadata

Some Abstract Pivot Algorithms

Curtis Greene, Thomas L. Magnanti

Source record

Source: Crossref

Published: Nov 1, 1975

DOI: 10.1137/0129045

Open original source ↗

Source abstract

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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.