Matroid Theory: 21 (Oxford Graduate Texts in Mathematics) - Image 1

Price loading...

Oxford University Press Matroid Theory: 21 (Oxford Graduate Texts in Mathematics)

Name: Matroid Theory: 21 (Oxford Graduate Texts in Mathematics)
Brand: Oxford University Press

78120

Algorithms

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

* What is the essence of the similarity between linearly independent sets of columns of a matrix and forests in a graph? * Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph? * Can we test in polynomial time whether a matrix is totally unimodular? Matroid theory examines and answers questions like these. Seventy-five years of study of matroids has seen the development of a rich theory with links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical and structural engineering. This book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over seven hundred exercises and includes, for the first time in one place, proofs of all of the major theorems in the subject. The last two chapters review current research and list more than eighty unsolved problems along with a description of the progress towards their solutions.

Product Specifications

Brand: Oxford University Press
Model: 78120
Format: hardcover
ASIN: 0198566948
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 17 February 2011
Listed Since: 14 October 2010

Barcode

No barcode data available

Oxford University Press Matroid Theory: 21 (Oxford Graduate Texts in Mathematics)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Matroid Theory (Oxford Graduate Texts In Mathematics): 21

Pattern Recognition on Oriented Matroids

Graph and Network Theory: An Applied Approach using Mathematica®: 193 (Springer Optimization and Its Applications, 193)

Exercises in Graph Theory: 19 (Texts in the Mathematical Sciences, 19)

Matrix Theory (Graduate Studies in Mathematics)

Graph Theory Applications (Universitext)

Oriented Matroids: 216 (Cambridge Studies in Advanced Mathematics, Series Number 216)

Graph Theory: 244 (Graduate Texts in Mathematics, 244)

CRC Press Combinatorial Matrix Theory to Laplacian Matrices

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Matrices and Matroids for Systems Analysis: 20 (Algorithms and Combinatorics, 20)

A Source Book in Matroid Theory

Matrices: Methods and Applications (Oxford Applied Mathematics and Computing Science Series)

Modern Graph Theory: 184 (Graduate Texts in Mathematics, 184)

Max-linear Systems: Theory and Algorithms (Springer Monographs in Mathematics)

Fundamentals of Graph Theory (Pure and Applied Undergraduate Texts)

DIRECT METHODS FOR SPARSE MATRICES 2E (Numerical Mathematics and Scientific Computation)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

CRC Press A Combinatorial Approach to Matrix Theory - Book

Combinatorics and Random Matrix Theory (Graduate Studies in Mathematics)

Combinatorics with Emphasis on the Theory of Graphs: 54 (Graduate Texts in Mathematics, 54)

Groups, Matrices, and Vector Spaces: A Group Theoretic Approach to Linear Algebra (Universitext)

Computational Oriented Matroids: Equivalence Classes of Matrices within a Natural Framework