FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Graph Separators, with Applications

Arnold L. Rosenberg, Lenwood S. Heath
    Product form
      FORMAT: Hardback

      R 3,032.31 Price and availability exclusive to website

      YOU COULD EARN 3,032.31 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 505.38 per month!
      3x monthly payments of R 1,010.77 with
      4x fortnightly payments of R 758.07 with
      Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.
      Format: CONTRIBUTORS: Arnold L. Rosenberg, Lenwood S. Heath EAN: 9780306464645 COUNTRY: United States PAGES: WEIGHT: 1230 g HEIGHT: 235 cm
      PUBLISHED BY: Springer Science+Business Media DATE PUBLISHED: 2001-06-30 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Data Science / General WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Mathematical theory of computation, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.
      Format: CONTRIBUTORS: Arnold L. Rosenberg, Lenwood S. Heath EAN: 9780306464645 COUNTRY: United States PAGES: WEIGHT: 1230 g HEIGHT: 235 cm
      PUBLISHED BY: Springer Science+Business Media DATE PUBLISHED: 2001-06-30 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Data Science / General WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Mathematical theory of computation, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account