9783662221457 - Matroid Theory and its Applications in Electric Network Theory and in Statics: 6 di Recski, Andras (12 risultati)

Condizione: New. In.

Paperback. Condizione: New.

Condizione: New. pp. 548.

Paperback. Condizione: Brand New. reprint edition. 548 pages. 9.61x6.69x1.24 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in creased with the spread of computers. Classical analysis did not even consider problems where 'only' a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con siderable detail. Some questions of this type (for example, the determination of when the so called 'greedy' algorithm is optimal) cannot even be answered without matroidal tools.

Paperback. Condizione: Like New. Like New. book.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in creased with the spread of computers. Classical analysis did not even consider problems where 'only' a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con siderable detail. Some questions of this type (for example, the determination of when the so called 'greedy' algorithm is optimal) cannot even be answered without matroidal tools. 548 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the.

Condizione: New. Print on Demand pp. 548 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 548.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in creased with the spread of computers. Classical analysis did not even consider problems where 'only' a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con siderable detail. Some questions of this type (for example, the determination of when the so called 'greedy' algorithm is optimal) cannot even be answered without matroidal tools.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 548 pp. Englisch.