×


 x 

Shopping cart
Rosenberg, Arnold L.; Heath, Lenwood S. - Graph Separators, with Applications - 9780306464645 - V9780306464645
Stock image for illustration purposes only - book cover, edition or condition may vary.

Graph Separators, with Applications

€ 127.24
FREE Delivery in Ireland
Description for Graph Separators, with Applications Hardback. Devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. This book surveys the main approaches to obtaining good graph separations. It focuses on techniques for deriving lower bounds on the sizes of graph separators. Series: Frontiers in Computer Science. Num Pages: 269 pages, biography. BIC Classification: PBWH; UMB; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 23. Weight in Grams: 1230.
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 ... Read more

Product Details

Format
Hardback
Publication date
2001
Publisher
Springer Science+Business Media United States
Number of pages
269
Condition
New
Series
Frontiers in Computer Science
Number of Pages
257
Place of Publication
, United States
ISBN
9780306464645
SKU
V9780306464645
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Graph Separators, with Applications

Goodreads reviews for Graph Separators, with Applications


Subscribe to our newsletter

News on special offers, signed editions & more!