Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Paperback. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Paperback. Zustand: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
Anbieter: MERS Goodwill, Saint Louis, MO, USA
Zustand: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable. Any access codes or passwords originally included with the book may be expired, used or no longer valid. Image is stock photo and cover art edition may be different than pictured.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Anbieter: INDOO, Avenel, NJ, USA
Zustand: New. Brand New.
Sprache: Englisch
Verlag: Dover Publications 11/10/2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. Combinatorial Optimization: Networks and Matroids. Book.
Anbieter: Lakeside Books, Benton Harbor, MI, USA
Zustand: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books!
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 23,09
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Dover Publications 2003-03-28, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 20,71
Anzahl: 20 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 23,64
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 24,60
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: moluna, Greven, Deutschland
EUR 23,64
Anzahl: Mehr als 20 verfügbar
In den WarenkorbKartoniert / Broschiert. Zustand: New. InhaltsverzeichnisrnrnPrefacen Chapter 1 INTRODUCTIONn Chapter 2 MATHEMATICAL PRELIMINARIES nChapter 3 SHORTEST PATHS nChapter 4 NETWORK FLOWS n Chapter 5 BIPARTITE MATCHING nChapter 6 NONBIPARTITE MATCHING n Chapter 7 MATROIDS AND THE GR.
Sprache: Englisch
Verlag: Dover Publications Nov 2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 23,66
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Sprache: Englisch
Verlag: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Paperback. Zustand: new. Paperback. Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Sprache: Englisch
Verlag: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 29,20
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: new. Paperback. Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.