<--- Back to Details
First PageDocument Content
Matroid theory / Mathematics / Discrete mathematics / Combinatorics / Regular matroid / Graphic matroid / Matroid / Dual matroid / Matroid minor / Matroid oracle
Date: 2018-08-04 05:57:44
Matroid theory
Mathematics
Discrete mathematics
Combinatorics
Regular matroid
Graphic matroid
Matroid
Dual matroid
Matroid minor
Matroid oracle

Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team

Add to Reading List

Source URL: doc.sagemath.org

Download Document from Source Website

File Size: 700,00 KB

Share Document on Facebook

Similar Documents

The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

DocID: 1qkDx - View Document

Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

DocID: 1pNBT - View Document

The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗  Alan L. Selman†

The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman†

DocID: c5aL - View Document

COMPLEXITY IN COOPERATIVE GAME THEORY  J. M. Bilbao1 , J. R. Fernández2 and J. J. López3 Matemática Aplicada II, Escuela Superior de Ingenieros Camino de los Descubrimientos s/n, 41092 Sevilla, Spain http://www.esi.us

COMPLEXITY IN COOPERATIVE GAME THEORY J. M. Bilbao1 , J. R. Fernández2 and J. J. López3 Matemática Aplicada II, Escuela Superior de Ingenieros Camino de los Descubrimientos s/n, 41092 Sevilla, Spain http://www.esi.us

DocID: 8Hsq - View Document