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

Graphs, Algorithms, and Optimization

List Price: $66.99
SKU:
9781032477152
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:
    William Kocay, Donald L. Kreher
    Format:
    Paperback
    Pages:
    566
    Publisher:
    CRC Press (January 21, 2023)
    Imprint:
    Chapman and Hall/CRC
    Language:
    English
    Audience:
    College/higher education
    ISBN-13:
    9781032477152
    Weight:
    16oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260403050944986-20260403.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $66.99
    Country of Origin:
    United States
    Pub Discount:
    30
    Series:
    Discrete Mathematics and Its Applications
    Case Pack:
    1
    As low as:
    $63.64
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
  • Overview

    This comprehensive text features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. It covers the major areas of graph theory, including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions