Skip to main content
SpringerLink
Log in
Book cover

Graph Separators, with Applications

  • Book
  • © 2002

Overview

Authors:
  1. Arnold L. Rosenberg

    1. University of Massachusetts, Amherst

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Lenwood S. Heath

    1. Virginia Polytechnic Institute, Blacksburg

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Frontiers in Computer Science (FCOS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. A Technical Introduction

    Pages 1-46

  3. Applications of Graph Separators

    Pages 47-97

  4. Upper-Bound Techniques

    Pages 99-158

  5. Lower-Bound Techniques

    Pages 159-225

  6. Back Matter

    Pages 227-257
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • University of Massachusetts, Amherst

    Arnold L. Rosenberg

  • Virginia Polytechnic Institute, Blacksburg

    Lenwood S. Heath

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation