rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Graph Separators, with Applications
  name:
    name part: Rosenberg, Arnold L.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Heath, Lenwood S.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxu
    date issued: 2002
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 257 p. online resource.
  abstract: 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.
  table of contents: A Technical Introduction -- Applications of Graph Separators -- Upper-Bound Techniques -- Lower-Bound Techniques.
  note: by Arnold L. Rosenberg, Lenwood S. Heath.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Mathematics of Computing
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Frontiers of Computer Science
  identifier: 9780306469770
  identifier: http://dx.doi.org/10.1007/b115747
  record info:
    record creation date: 100301
    record change date: 20151030061447.0
    record identifier: 978-0-306-46977-0