Graph Separators, with Applications (Frontiers in Computer Science) - Tapa dura

Rosenberg, Arnold L.; Heath, Lenwood S.

 
9780306464645: Graph Separators, with Applications (Frontiers in Computer Science)
Tapa dura
ISBN 10: 0306464640 ISBN 13: 9780306464645
Editorial: Springer, 2001

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2001
Idioma
Inglés
ISBN 10 
0306464640
ISBN 13 
9780306464645
Encuadernación
Tapa dura
Número de páginas
272
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9781475787641: Graph Separators, with Applications (Frontiers in Computer Science)

Edición Destacada

ISBN 10:  1475787642 ISBN 13:  9781475787641
Editorial: Springer, 2013
Tapa blanda