null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Algorithmische Graphentheorie (Deterministische und randomisierte Algorithmen) (German Edition)

List Price: $70.99
SKU:
9783111352701
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Volker Turau, Christoph Weyer
    Format:
    Paperback
    Pages:
    464
    Publisher:
    De Gruyter (August 6, 2024)
    Language:
    German
    Audience:
    College/higher education
    ISBN-13:
    9783111352701
    ISBN-10:
    3111352706
    Dimensions:
    6.69" x 9.45"
    File:
    TWO RIVERS-PERSEUS-Perseus_Distribution_Customer_Group_Metadata_20260322181037-20260322.xml
    Folder:
    TWO RIVERS
    List Price:
    $70.99
    Country of Origin:
    Germany
    Series:
    De Gruyter Studium
    As low as:
    $61.05
    Publisher Identifier:
    P-PER
    Discount Code:
    C
    Pub Discount:
    60
    Weight:
    25.92oz
    Imprint:
    De Gruyter Oldenbourg
  • Overview

    Der Schwerpunkt dieses Werks liegt in der praktischen Anwendung der Algorithmen auf aktuelle Probleme innerhalb der Informatik. Die Algorithmen sind in kompakter Form in programmiersprachennaher Notation dargestellt, die eine leichte Übertragung in objektorientierte Programmiersprachen erlaubt. Optimale Prüfungsvorbereitung durch Übungsaufgaben in verschiedenen Schwierigkeitsgraden für das Bachelor- und das Masterstudium.