
Graph Separators, with Applications
Plenum Publishing Co.,N.Y.
Published on 30. June 2001
Book
Hardback
XII, 257 pages
978-0-306-46464-5 (ISBN)
Description
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.
More details
Series
Edition
2002 ed.
Language
English
Place of publication
New York
United States
Publishing group
Springer Science+Business Media
Target group
Professional and scholarly
Research
Illustrations
XII, 257 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 21 mm
Weight
574 gr
ISBN-13
978-0-306-46464-5 (9780306464645)
DOI
10.1007/b115747
Schweitzer Classification
Other editions
Additional editions

Arnold L. Rosenberg | Lenwood S. Heath
Graph Separators, with Applications
Book
04/2013
Springer
€106.99
Shipment within 15-20 days

Arnold L. Rosenberg | Lenwood S. Heath
Graph Separators, with Applications
E-Book
12/2005
Kluwer Academic / Plenum Publishers
€96.29
Available for download
Content
A Technical Introduction.- Applications of Graph Separators.- Upper-Bound Techniques.- Lower-Bound Techniques.