Book by Lawler Eugene L
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BGV Books LLC, Murray, KY, Etats-Unis
Etat : Good. Exact ISBN match. Immediate shipping. No funny business. N° de réf. du vendeur 9780030848667
Quantité disponible : 2 disponible(s)
Vendeur : Fables Books, Goshen, IN, Etats-Unis
Etat : acceptable. Significant shelf, storage or usage wear present that does not affect the readability of the boo, including moderately heavy water damage. A former library book with all the expected stamps, stickers and markings. No dustjacket included, as pictured. The pages appear aged but unmarked. Staining on the cover and page edges. Hinges are intact. The binding is intact and all pages are present. Pictures available upon request. Individually inspected by Shay. Thanks for supporting an independent bookseller! N° de réf. du vendeur FBV.0030848660.A
Quantité disponible : 1 disponible(s)
Vendeur : About Books, Henderson, NV, Etats-Unis
Hardcover. Etat : Very Good condition. First Printing of the First Edition. New York: Holt, Rinehart and Winston, 1976. Very Good condition. Square, tight, unmarked copy. Lower corner of cover slightly bumped (not creasing or otherwise affecting any pages). Old price on rear cover. Scarce in Hardcover. No owner's name or bookplate. No remainder mark. No underlining. No highlighting. Illustrated with line drawings and diagrams. Index. From the publisher: "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." . First Printing of the First Edition. Hardcover. Very Good condition. 8vo. x, 374pp . N° de réf. du vendeur 010032
Quantité disponible : 1 disponible(s)
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 LAW 9780030848667 Sprache: Englisch Gewicht in Gramm: 1150. N° de réf. du vendeur 2506847
Quantité disponible : 1 disponible(s)
Vendeur : Kloof Booksellers & Scientia Verlag, Amsterdam, Pays-Bas
Etat : as new. New York & London : Holt, Rinehart and Winston, [1976]. Hardcover. x,374 pp. ills. 24cm. Condition : as new copy. ISBN 9780030848667. Keywords : MATHEMATICS, N° de réf. du vendeur 300191
Quantité disponible : 1 disponible(s)
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 384 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. N° de réf. du vendeur 41818187/202
Quantité disponible : 1 disponible(s)